./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd0d88d2f020ad500dbef5f24f986f709ccc4001 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:23:48,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:23:48,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:23:48,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:23:48,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:23:48,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:23:48,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:23:48,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:23:48,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:23:48,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:23:48,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:23:48,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:23:48,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:23:48,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:23:48,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:23:48,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:23:48,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:23:48,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:23:48,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:23:48,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:23:48,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:23:48,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:23:48,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:23:48,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:23:48,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:23:48,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:23:48,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:23:48,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:23:48,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:23:48,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:23:48,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:23:48,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:23:48,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:23:48,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:23:48,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:23:48,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:23:48,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:23:48,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:23:48,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:23:48,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:23:48,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:23:48,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:23:48,082 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:23:48,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:23:48,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:23:48,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:23:48,083 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:23:48,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:23:48,083 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:23:48,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:23:48,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:23:48,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:23:48,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:23:48,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:23:48,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:23:48,084 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:23:48,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:23:48,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:23:48,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:23:48,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:23:48,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:23:48,085 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:23:48,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:23:48,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:23:48,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:23:48,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:23:48,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:23:48,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:23:48,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:23:48,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:23:48,086 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:23:48,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd0d88d2f020ad500dbef5f24f986f709ccc4001 [2019-12-07 14:23:48,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:23:48,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:23:48,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:23:48,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:23:48,198 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:23:48,199 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i [2019-12-07 14:23:48,242 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/data/07b4f4976/196caec3e87645698f596b6cba32bd15/FLAGf2e37cb49 [2019-12-07 14:23:48,669 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:23:48,670 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i [2019-12-07 14:23:48,682 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/data/07b4f4976/196caec3e87645698f596b6cba32bd15/FLAGf2e37cb49 [2019-12-07 14:23:49,008 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/data/07b4f4976/196caec3e87645698f596b6cba32bd15 [2019-12-07 14:23:49,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:23:49,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:23:49,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:49,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:23:49,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:23:49,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82a85e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49, skipping insertion in model container [2019-12-07 14:23:49,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:23:49,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:23:49,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:49,287 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:23:49,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:23:49,373 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:23:49,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49 WrapperNode [2019-12-07 14:23:49,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:23:49,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:49,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:23:49,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:23:49,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:23:49,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:23:49,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:23:49,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:23:49,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... [2019-12-07 14:23:49,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:23:49,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:23:49,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:23:49,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:23:49,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:23:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:23:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:23:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:23:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:23:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:23:49,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:23:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:23:49,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:23:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:23:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:23:49,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:23:49,489 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:23:49,817 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:23:49,817 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:23:49,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:49 BoogieIcfgContainer [2019-12-07 14:23:49,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:23:49,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:23:49,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:23:49,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:23:49,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:23:49" (1/3) ... [2019-12-07 14:23:49,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499bdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:49, skipping insertion in model container [2019-12-07 14:23:49,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:23:49" (2/3) ... [2019-12-07 14:23:49,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499bdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:23:49, skipping insertion in model container [2019-12-07 14:23:49,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:49" (3/3) ... [2019-12-07 14:23:49,822 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc.i [2019-12-07 14:23:49,828 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:23:49,828 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:23:49,833 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:23:49,833 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:23:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,860 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:23:49,893 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:23:49,905 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:23:49,905 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:23:49,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:23:49,906 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:23:49,906 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:23:49,906 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:23:49,906 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:23:49,906 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:23:49,916 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-07 14:23:49,917 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-07 14:23:49,965 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-07 14:23:49,965 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:23:49,975 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:23:49,987 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-07 14:23:50,009 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-07 14:23:50,010 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:23:50,015 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 14:23:50,028 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 14:23:50,029 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:23:52,540 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 14:23:52,638 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-12-07 14:23:52,638 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-12-07 14:23:52,640 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-07 14:23:52,889 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-12-07 14:23:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-12-07 14:23:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:23:52,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:52,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:23:52,896 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:52,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:52,900 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-12-07 14:23:52,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:52,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005334324] [2019-12-07 14:23:52,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:53,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005334324] [2019-12-07 14:23:53,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:53,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:23:53,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608728487] [2019-12-07 14:23:53,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:53,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:53,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:53,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:53,069 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-12-07 14:23:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:53,244 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-12-07 14:23:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:53,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:23:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:53,305 INFO L225 Difference]: With dead ends: 6636 [2019-12-07 14:23:53,305 INFO L226 Difference]: Without dead ends: 6246 [2019-12-07 14:23:53,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-12-07 14:23:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-12-07 14:23:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-12-07 14:23:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-12-07 14:23:53,542 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-12-07 14:23:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:53,542 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-12-07 14:23:53,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-12-07 14:23:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:23:53,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:53,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:53,546 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-12-07 14:23:53,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:53,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962827081] [2019-12-07 14:23:53,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:53,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962827081] [2019-12-07 14:23:53,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:53,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:53,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356743480] [2019-12-07 14:23:53,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:53,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:53,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:53,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:53,631 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-12-07 14:23:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:53,834 INFO L93 Difference]: Finished difference Result 9424 states and 30254 transitions. [2019-12-07 14:23:53,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:53,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:23:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:53,888 INFO L225 Difference]: With dead ends: 9424 [2019-12-07 14:23:53,888 INFO L226 Difference]: Without dead ends: 9411 [2019-12-07 14:23:53,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-12-07 14:23:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 8307. [2019-12-07 14:23:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-12-07 14:23:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 27132 transitions. [2019-12-07 14:23:54,088 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 27132 transitions. Word has length 11 [2019-12-07 14:23:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:54,088 INFO L462 AbstractCegarLoop]: Abstraction has 8307 states and 27132 transitions. [2019-12-07 14:23:54,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 27132 transitions. [2019-12-07 14:23:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:23:54,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:54,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:54,091 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:54,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:54,092 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-12-07 14:23:54,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:54,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002400649] [2019-12-07 14:23:54,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:54,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002400649] [2019-12-07 14:23:54,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:54,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:54,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557812484] [2019-12-07 14:23:54,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:54,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:54,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:54,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:54,124 INFO L87 Difference]: Start difference. First operand 8307 states and 27132 transitions. Second operand 3 states. [2019-12-07 14:23:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:54,238 INFO L93 Difference]: Finished difference Result 11392 states and 37048 transitions. [2019-12-07 14:23:54,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:54,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 14:23:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:54,273 INFO L225 Difference]: With dead ends: 11392 [2019-12-07 14:23:54,273 INFO L226 Difference]: Without dead ends: 11392 [2019-12-07 14:23:54,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2019-12-07 14:23:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 10440. [2019-12-07 14:23:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10440 states. [2019-12-07 14:23:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10440 states to 10440 states and 34208 transitions. [2019-12-07 14:23:54,504 INFO L78 Accepts]: Start accepts. Automaton has 10440 states and 34208 transitions. Word has length 14 [2019-12-07 14:23:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:54,505 INFO L462 AbstractCegarLoop]: Abstraction has 10440 states and 34208 transitions. [2019-12-07 14:23:54,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 10440 states and 34208 transitions. [2019-12-07 14:23:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:23:54,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:54,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:54,507 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-12-07 14:23:54,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:54,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838963615] [2019-12-07 14:23:54,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:54,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838963615] [2019-12-07 14:23:54,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:54,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:54,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084317010] [2019-12-07 14:23:54,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:54,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:54,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:54,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:54,549 INFO L87 Difference]: Start difference. First operand 10440 states and 34208 transitions. Second operand 4 states. [2019-12-07 14:23:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:54,685 INFO L93 Difference]: Finished difference Result 12648 states and 40515 transitions. [2019-12-07 14:23:54,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:54,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:23:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:54,704 INFO L225 Difference]: With dead ends: 12648 [2019-12-07 14:23:54,704 INFO L226 Difference]: Without dead ends: 12637 [2019-12-07 14:23:54,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2019-12-07 14:23:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 11272. [2019-12-07 14:23:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11272 states. [2019-12-07 14:23:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11272 states to 11272 states and 36643 transitions. [2019-12-07 14:23:54,894 INFO L78 Accepts]: Start accepts. Automaton has 11272 states and 36643 transitions. Word has length 14 [2019-12-07 14:23:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:54,894 INFO L462 AbstractCegarLoop]: Abstraction has 11272 states and 36643 transitions. [2019-12-07 14:23:54,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 11272 states and 36643 transitions. [2019-12-07 14:23:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:23:54,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:54,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:54,896 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-12-07 14:23:54,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:54,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009728280] [2019-12-07 14:23:54,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:54,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009728280] [2019-12-07 14:23:54,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:54,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:54,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144156034] [2019-12-07 14:23:54,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:54,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:54,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:54,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:54,929 INFO L87 Difference]: Start difference. First operand 11272 states and 36643 transitions. Second operand 4 states. [2019-12-07 14:23:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:55,060 INFO L93 Difference]: Finished difference Result 13620 states and 43661 transitions. [2019-12-07 14:23:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:55,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 14:23:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:55,086 INFO L225 Difference]: With dead ends: 13620 [2019-12-07 14:23:55,086 INFO L226 Difference]: Without dead ends: 13607 [2019-12-07 14:23:55,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-07 14:23:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 11607. [2019-12-07 14:23:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-12-07 14:23:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 37707 transitions. [2019-12-07 14:23:55,309 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 37707 transitions. Word has length 14 [2019-12-07 14:23:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:55,309 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 37707 transitions. [2019-12-07 14:23:55,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 37707 transitions. [2019-12-07 14:23:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:23:55,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:55,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:55,312 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 833908596, now seen corresponding path program 1 times [2019-12-07 14:23:55,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:55,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697102755] [2019-12-07 14:23:55,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:55,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697102755] [2019-12-07 14:23:55,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:55,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:55,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667665557] [2019-12-07 14:23:55,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:23:55,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:55,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:23:55,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:23:55,361 INFO L87 Difference]: Start difference. First operand 11607 states and 37707 transitions. Second operand 4 states. [2019-12-07 14:23:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:55,384 INFO L93 Difference]: Finished difference Result 2510 states and 6601 transitions. [2019-12-07 14:23:55,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:23:55,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 14:23:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:55,387 INFO L225 Difference]: With dead ends: 2510 [2019-12-07 14:23:55,387 INFO L226 Difference]: Without dead ends: 1779 [2019-12-07 14:23:55,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-07 14:23:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2019-12-07 14:23:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-12-07 14:23:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 4301 transitions. [2019-12-07 14:23:55,404 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 4301 transitions. Word has length 16 [2019-12-07 14:23:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:55,405 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 4301 transitions. [2019-12-07 14:23:55,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:23:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 4301 transitions. [2019-12-07 14:23:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:23:55,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:55,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:55,407 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-12-07 14:23:55,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:55,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369732921] [2019-12-07 14:23:55,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:55,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369732921] [2019-12-07 14:23:55,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:55,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:55,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801643009] [2019-12-07 14:23:55,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:55,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:55,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:55,452 INFO L87 Difference]: Start difference. First operand 1779 states and 4301 transitions. Second operand 5 states. [2019-12-07 14:23:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:55,578 INFO L93 Difference]: Finished difference Result 2379 states and 5678 transitions. [2019-12-07 14:23:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:23:55,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:23:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:55,580 INFO L225 Difference]: With dead ends: 2379 [2019-12-07 14:23:55,580 INFO L226 Difference]: Without dead ends: 2377 [2019-12-07 14:23:55,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-07 14:23:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1893. [2019-12-07 14:23:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-12-07 14:23:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 4570 transitions. [2019-12-07 14:23:55,599 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 4570 transitions. Word has length 26 [2019-12-07 14:23:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:55,599 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 4570 transitions. [2019-12-07 14:23:55,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 4570 transitions. [2019-12-07 14:23:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 14:23:55,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:55,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:55,601 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:55,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:55,601 INFO L82 PathProgramCache]: Analyzing trace with hash -673024853, now seen corresponding path program 1 times [2019-12-07 14:23:55,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:55,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077318327] [2019-12-07 14:23:55,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:55,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077318327] [2019-12-07 14:23:55,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:55,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:55,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383942683] [2019-12-07 14:23:55,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:55,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:55,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:55,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:55,652 INFO L87 Difference]: Start difference. First operand 1893 states and 4570 transitions. Second operand 5 states. [2019-12-07 14:23:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:55,888 INFO L93 Difference]: Finished difference Result 2701 states and 6403 transitions. [2019-12-07 14:23:55,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:55,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 14:23:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:55,890 INFO L225 Difference]: With dead ends: 2701 [2019-12-07 14:23:55,890 INFO L226 Difference]: Without dead ends: 2701 [2019-12-07 14:23:55,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2019-12-07 14:23:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2281. [2019-12-07 14:23:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-12-07 14:23:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 5445 transitions. [2019-12-07 14:23:55,924 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 5445 transitions. Word has length 26 [2019-12-07 14:23:55,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:55,924 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 5445 transitions. [2019-12-07 14:23:55,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 5445 transitions. [2019-12-07 14:23:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:23:55,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:55,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:55,928 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash 427469221, now seen corresponding path program 1 times [2019-12-07 14:23:55,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:55,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196579647] [2019-12-07 14:23:55,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:55,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196579647] [2019-12-07 14:23:55,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:55,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:23:55,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829152612] [2019-12-07 14:23:55,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:55,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:55,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:55,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:55,984 INFO L87 Difference]: Start difference. First operand 2281 states and 5445 transitions. Second operand 5 states. [2019-12-07 14:23:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:56,108 INFO L93 Difference]: Finished difference Result 2800 states and 6613 transitions. [2019-12-07 14:23:56,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:23:56,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 14:23:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:56,111 INFO L225 Difference]: With dead ends: 2800 [2019-12-07 14:23:56,111 INFO L226 Difference]: Without dead ends: 2798 [2019-12-07 14:23:56,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2019-12-07 14:23:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2217. [2019-12-07 14:23:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-07 14:23:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 5286 transitions. [2019-12-07 14:23:56,133 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 5286 transitions. Word has length 27 [2019-12-07 14:23:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:56,133 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 5286 transitions. [2019-12-07 14:23:56,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 5286 transitions. [2019-12-07 14:23:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:23:56,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:56,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:56,136 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:56,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash 225506980, now seen corresponding path program 1 times [2019-12-07 14:23:56,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:56,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129897999] [2019-12-07 14:23:56,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:56,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129897999] [2019-12-07 14:23:56,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:56,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:56,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391187654] [2019-12-07 14:23:56,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:56,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:56,201 INFO L87 Difference]: Start difference. First operand 2217 states and 5286 transitions. Second operand 5 states. [2019-12-07 14:23:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:56,241 INFO L93 Difference]: Finished difference Result 1251 states and 2791 transitions. [2019-12-07 14:23:56,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:23:56,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 14:23:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:56,243 INFO L225 Difference]: With dead ends: 1251 [2019-12-07 14:23:56,243 INFO L226 Difference]: Without dead ends: 1109 [2019-12-07 14:23:56,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-12-07 14:23:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 989. [2019-12-07 14:23:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-12-07 14:23:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2218 transitions. [2019-12-07 14:23:56,254 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 2218 transitions. Word has length 27 [2019-12-07 14:23:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:56,254 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 2218 transitions. [2019-12-07 14:23:56,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 2218 transitions. [2019-12-07 14:23:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:23:56,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:56,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:56,256 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1687726867, now seen corresponding path program 1 times [2019-12-07 14:23:56,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:56,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677764208] [2019-12-07 14:23:56,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:56,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677764208] [2019-12-07 14:23:56,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:56,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:23:56,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745428076] [2019-12-07 14:23:56,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:56,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:56,318 INFO L87 Difference]: Start difference. First operand 989 states and 2218 transitions. Second operand 6 states. [2019-12-07 14:23:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:56,638 INFO L93 Difference]: Finished difference Result 1287 states and 2810 transitions. [2019-12-07 14:23:56,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:23:56,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 14:23:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:56,640 INFO L225 Difference]: With dead ends: 1287 [2019-12-07 14:23:56,640 INFO L226 Difference]: Without dead ends: 1287 [2019-12-07 14:23:56,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:23:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-12-07 14:23:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1021. [2019-12-07 14:23:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2019-12-07 14:23:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 2284 transitions. [2019-12-07 14:23:56,650 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 2284 transitions. Word has length 41 [2019-12-07 14:23:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:56,650 INFO L462 AbstractCegarLoop]: Abstraction has 1021 states and 2284 transitions. [2019-12-07 14:23:56,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 2284 transitions. [2019-12-07 14:23:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:23:56,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:56,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:56,652 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:56,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:56,652 INFO L82 PathProgramCache]: Analyzing trace with hash 166240103, now seen corresponding path program 2 times [2019-12-07 14:23:56,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:56,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878709848] [2019-12-07 14:23:56,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:56,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878709848] [2019-12-07 14:23:56,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:56,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:23:56,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750840225] [2019-12-07 14:23:56,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:23:56,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:56,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:23:56,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:23:56,700 INFO L87 Difference]: Start difference. First operand 1021 states and 2284 transitions. Second operand 6 states. [2019-12-07 14:23:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:56,847 INFO L93 Difference]: Finished difference Result 2503 states and 5482 transitions. [2019-12-07 14:23:56,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:23:56,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 14:23:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:56,849 INFO L225 Difference]: With dead ends: 2503 [2019-12-07 14:23:56,849 INFO L226 Difference]: Without dead ends: 1679 [2019-12-07 14:23:56,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:23:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-12-07 14:23:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1099. [2019-12-07 14:23:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-12-07 14:23:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2457 transitions. [2019-12-07 14:23:56,862 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2457 transitions. Word has length 41 [2019-12-07 14:23:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:56,862 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2457 transitions. [2019-12-07 14:23:56,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:23:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2457 transitions. [2019-12-07 14:23:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:23:56,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:56,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:56,864 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2071793039, now seen corresponding path program 3 times [2019-12-07 14:23:56,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:56,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864290680] [2019-12-07 14:23:56,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:56,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864290680] [2019-12-07 14:23:56,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:56,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:23:56,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170949242] [2019-12-07 14:23:56,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:23:56,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:56,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:23:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:56,898 INFO L87 Difference]: Start difference. First operand 1099 states and 2457 transitions. Second operand 3 states. [2019-12-07 14:23:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:56,908 INFO L93 Difference]: Finished difference Result 1097 states and 2452 transitions. [2019-12-07 14:23:56,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:23:56,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 14:23:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:56,910 INFO L225 Difference]: With dead ends: 1097 [2019-12-07 14:23:56,910 INFO L226 Difference]: Without dead ends: 1097 [2019-12-07 14:23:56,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:23:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2019-12-07 14:23:56,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 960. [2019-12-07 14:23:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-07 14:23:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2183 transitions. [2019-12-07 14:23:56,923 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2183 transitions. Word has length 41 [2019-12-07 14:23:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:56,924 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2183 transitions. [2019-12-07 14:23:56,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:23:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2183 transitions. [2019-12-07 14:23:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:23:56,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:56,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:56,926 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:56,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:56,926 INFO L82 PathProgramCache]: Analyzing trace with hash -186633826, now seen corresponding path program 1 times [2019-12-07 14:23:56,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:56,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844004577] [2019-12-07 14:23:56,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:56,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844004577] [2019-12-07 14:23:56,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:56,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:23:56,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061146337] [2019-12-07 14:23:56,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:23:56,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:56,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:23:56,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:23:56,995 INFO L87 Difference]: Start difference. First operand 960 states and 2183 transitions. Second operand 5 states. [2019-12-07 14:23:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:57,020 INFO L93 Difference]: Finished difference Result 1641 states and 3731 transitions. [2019-12-07 14:23:57,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:23:57,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 14:23:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:57,021 INFO L225 Difference]: With dead ends: 1641 [2019-12-07 14:23:57,021 INFO L226 Difference]: Without dead ends: 709 [2019-12-07 14:23:57,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-12-07 14:23:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2019-12-07 14:23:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-12-07 14:23:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1596 transitions. [2019-12-07 14:23:57,028 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1596 transitions. Word has length 42 [2019-12-07 14:23:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:57,028 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1596 transitions. [2019-12-07 14:23:57,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:23:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1596 transitions. [2019-12-07 14:23:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:23:57,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:57,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:57,030 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 380081836, now seen corresponding path program 2 times [2019-12-07 14:23:57,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:57,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354981942] [2019-12-07 14:23:57,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:57,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354981942] [2019-12-07 14:23:57,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:57,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:23:57,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001233743] [2019-12-07 14:23:57,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:23:57,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:23:57,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:23:57,202 INFO L87 Difference]: Start difference. First operand 709 states and 1596 transitions. Second operand 12 states. [2019-12-07 14:23:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:57,566 INFO L93 Difference]: Finished difference Result 1096 states and 2399 transitions. [2019-12-07 14:23:57,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:23:57,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-12-07 14:23:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:57,567 INFO L225 Difference]: With dead ends: 1096 [2019-12-07 14:23:57,567 INFO L226 Difference]: Without dead ends: 797 [2019-12-07 14:23:57,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:23:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-07 14:23:57,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 747. [2019-12-07 14:23:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-12-07 14:23:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1680 transitions. [2019-12-07 14:23:57,573 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1680 transitions. Word has length 42 [2019-12-07 14:23:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:57,573 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1680 transitions. [2019-12-07 14:23:57,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:23:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1680 transitions. [2019-12-07 14:23:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:23:57,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:57,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:57,574 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:57,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:57,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1232492420, now seen corresponding path program 3 times [2019-12-07 14:23:57,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:57,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567150180] [2019-12-07 14:23:57,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:23:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:23:57,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567150180] [2019-12-07 14:23:57,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:23:57,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:23:57,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053199375] [2019-12-07 14:23:57,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:23:57,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:23:57,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:23:57,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:23:57,630 INFO L87 Difference]: Start difference. First operand 747 states and 1680 transitions. Second operand 7 states. [2019-12-07 14:23:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:23:57,737 INFO L93 Difference]: Finished difference Result 1130 states and 2482 transitions. [2019-12-07 14:23:57,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:23:57,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 14:23:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:23:57,738 INFO L225 Difference]: With dead ends: 1130 [2019-12-07 14:23:57,738 INFO L226 Difference]: Without dead ends: 741 [2019-12-07 14:23:57,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:23:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-12-07 14:23:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 697. [2019-12-07 14:23:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-07 14:23:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1570 transitions. [2019-12-07 14:23:57,744 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1570 transitions. Word has length 42 [2019-12-07 14:23:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:23:57,744 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1570 transitions. [2019-12-07 14:23:57,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:23:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1570 transitions. [2019-12-07 14:23:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 14:23:57,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:23:57,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:23:57,745 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:23:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:23:57,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 4 times [2019-12-07 14:23:57,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:23:57,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750003628] [2019-12-07 14:23:57,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:23:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:23:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:23:57,798 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:23:57,798 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:23:57,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1653~0.base_19| 4)) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) (= v_~y$r_buff0_thd0~0_127 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19|) 0) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) |v_ULTIMATE.start_main_~#t1653~0.offset_17| 0)) |v_#memory_int_11|) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0) (= 0 |v_ULTIMATE.start_main_~#t1653~0.offset_17|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_17|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ULTIMATE.start_main_~#t1653~0.offset=|v_ULTIMATE.start_main_~#t1653~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_22|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1653~0.base=|v_ULTIMATE.start_main_~#t1653~0.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1654~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ULTIMATE.start_main_~#t1653~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1654~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1653~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:23:57,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1654~0.base_9| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1654~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9|) |v_ULTIMATE.start_main_~#t1654~0.offset_8| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1654~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1654~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1654~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1654~0.base] because there is no mapped edge [2019-12-07 14:23:57,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:23:57,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1379161432 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1379161432 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1379161432| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1379161432| ~y$w_buff0_used~0_In-1379161432) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1379161432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1379161432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1379161432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1379161432, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1379161432|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:23:57,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1326380431 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1326380431 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1326380431 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1326380431 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1326380431 |P1Thread1of1ForFork0_#t~ite29_Out-1326380431|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1326380431|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1326380431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326380431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1326380431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326380431} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1326380431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326380431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1326380431, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1326380431|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326380431} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:23:57,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1238633552 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1238633552 256) 0)) (.cse1 (= ~y$r_buff0_thd2~0_Out1238633552 ~y$r_buff0_thd2~0_In1238633552))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd2~0_Out1238633552 0) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1238633552, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1238633552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1238633552, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1238633552|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1238633552} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:23:57,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-429561954 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite17_In-429561954| |P0Thread1of1ForFork1_#t~ite17_Out-429561954|) (= |P0Thread1of1ForFork1_#t~ite18_Out-429561954| ~y$w_buff1_used~0_In-429561954) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-429561954 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-429561954 256))) (= (mod ~y$w_buff0_used~0_In-429561954 256) 0) (and (= (mod ~y$w_buff1_used~0_In-429561954 256) 0) .cse1))) (= ~y$w_buff1_used~0_In-429561954 |P0Thread1of1ForFork1_#t~ite17_Out-429561954|) (= |P0Thread1of1ForFork1_#t~ite18_Out-429561954| |P0Thread1of1ForFork1_#t~ite17_Out-429561954|) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-429561954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429561954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-429561954, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-429561954|, ~weak$$choice2~0=~weak$$choice2~0_In-429561954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429561954} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-429561954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429561954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-429561954, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-429561954|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-429561954|, ~weak$$choice2~0=~weak$$choice2~0_In-429561954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429561954} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 14:23:57,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:23:57,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 14:23:57,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-129970332 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-129970332 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-129970332 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-129970332 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-129970332|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-129970332 |P1Thread1of1ForFork0_#t~ite31_Out-129970332|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-129970332, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-129970332, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-129970332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-129970332} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-129970332, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-129970332, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-129970332|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-129970332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-129970332} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:23:57,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:23:57,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:23:57,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In827910094 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In827910094 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out827910094| ~y$w_buff1~0_In827910094)) (and (= ~y~0_In827910094 |ULTIMATE.start_main_#t~ite34_Out827910094|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In827910094, ~y~0=~y~0_In827910094, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In827910094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In827910094} OutVars{~y$w_buff1~0=~y$w_buff1~0_In827910094, ~y~0=~y~0_In827910094, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In827910094, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out827910094|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In827910094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:23:57,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:23:57,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In627714987 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In627714987 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out627714987| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In627714987 |ULTIMATE.start_main_#t~ite36_Out627714987|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In627714987, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In627714987} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In627714987, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In627714987, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out627714987|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:23:57,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1777011514 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1777011514 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1777011514 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1777011514 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out-1777011514| ~y$w_buff1_used~0_In-1777011514)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1777011514|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1777011514, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1777011514, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1777011514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1777011514} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1777011514, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1777011514, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1777011514|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1777011514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1777011514} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:23:57,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2013483522 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2013483522 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-2013483522| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out-2013483522| ~y$r_buff0_thd0~0_In-2013483522) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2013483522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2013483522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2013483522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2013483522, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2013483522|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:23:57,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In185211934 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In185211934 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In185211934 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In185211934 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out185211934| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out185211934| ~y$r_buff1_thd0~0_In185211934)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In185211934, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In185211934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185211934, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185211934} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In185211934, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out185211934|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In185211934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185211934, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185211934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:23:57,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:23:57,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:23:57 BasicIcfg [2019-12-07 14:23:57,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:23:57,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:23:57,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:23:57,845 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:23:57,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:23:49" (3/4) ... [2019-12-07 14:23:57,847 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:23:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1653~0.base_19| 4)) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) (= v_~y$r_buff0_thd0~0_127 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19|) 0) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) |v_ULTIMATE.start_main_~#t1653~0.offset_17| 0)) |v_#memory_int_11|) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0) (= 0 |v_ULTIMATE.start_main_~#t1653~0.offset_17|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_17|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ULTIMATE.start_main_~#t1653~0.offset=|v_ULTIMATE.start_main_~#t1653~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_22|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1653~0.base=|v_ULTIMATE.start_main_~#t1653~0.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1654~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ULTIMATE.start_main_~#t1653~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1654~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1653~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:23:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1654~0.base_9| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1654~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9|) |v_ULTIMATE.start_main_~#t1654~0.offset_8| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1654~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1654~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1654~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1654~0.base] because there is no mapped edge [2019-12-07 14:23:57,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:23:57,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1379161432 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1379161432 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1379161432| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1379161432| ~y$w_buff0_used~0_In-1379161432) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1379161432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1379161432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1379161432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1379161432, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1379161432|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:23:57,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1326380431 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1326380431 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1326380431 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1326380431 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1326380431 |P1Thread1of1ForFork0_#t~ite29_Out-1326380431|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1326380431|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1326380431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326380431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1326380431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326380431} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1326380431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1326380431, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1326380431, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1326380431|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1326380431} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:23:57,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1238633552 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1238633552 256) 0)) (.cse1 (= ~y$r_buff0_thd2~0_Out1238633552 ~y$r_buff0_thd2~0_In1238633552))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd2~0_Out1238633552 0) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1238633552, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1238633552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1238633552, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1238633552|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1238633552} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:23:57,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-429561954 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite17_In-429561954| |P0Thread1of1ForFork1_#t~ite17_Out-429561954|) (= |P0Thread1of1ForFork1_#t~ite18_Out-429561954| ~y$w_buff1_used~0_In-429561954) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-429561954 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-429561954 256))) (= (mod ~y$w_buff0_used~0_In-429561954 256) 0) (and (= (mod ~y$w_buff1_used~0_In-429561954 256) 0) .cse1))) (= ~y$w_buff1_used~0_In-429561954 |P0Thread1of1ForFork1_#t~ite17_Out-429561954|) (= |P0Thread1of1ForFork1_#t~ite18_Out-429561954| |P0Thread1of1ForFork1_#t~ite17_Out-429561954|) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-429561954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429561954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-429561954, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-429561954|, ~weak$$choice2~0=~weak$$choice2~0_In-429561954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429561954} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-429561954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-429561954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-429561954, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-429561954|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-429561954|, ~weak$$choice2~0=~weak$$choice2~0_In-429561954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-429561954} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 14:23:57,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:23:57,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 14:23:57,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-129970332 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-129970332 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-129970332 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-129970332 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-129970332|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-129970332 |P1Thread1of1ForFork0_#t~ite31_Out-129970332|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-129970332, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-129970332, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-129970332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-129970332} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-129970332, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-129970332, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-129970332|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-129970332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-129970332} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:23:57,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:23:57,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:23:57,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In827910094 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In827910094 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out827910094| ~y$w_buff1~0_In827910094)) (and (= ~y~0_In827910094 |ULTIMATE.start_main_#t~ite34_Out827910094|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In827910094, ~y~0=~y~0_In827910094, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In827910094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In827910094} OutVars{~y$w_buff1~0=~y$w_buff1~0_In827910094, ~y~0=~y~0_In827910094, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In827910094, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out827910094|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In827910094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:23:57,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 14:23:57,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In627714987 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In627714987 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out627714987| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In627714987 |ULTIMATE.start_main_#t~ite36_Out627714987|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In627714987, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In627714987} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In627714987, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In627714987, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out627714987|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 14:23:57,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1777011514 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1777011514 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1777011514 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1777011514 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out-1777011514| ~y$w_buff1_used~0_In-1777011514)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1777011514|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1777011514, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1777011514, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1777011514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1777011514} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1777011514, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1777011514, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1777011514|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1777011514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1777011514} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:23:57,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2013483522 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2013483522 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-2013483522| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out-2013483522| ~y$r_buff0_thd0~0_In-2013483522) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2013483522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2013483522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2013483522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2013483522, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2013483522|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:23:57,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In185211934 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In185211934 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In185211934 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In185211934 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out185211934| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out185211934| ~y$r_buff1_thd0~0_In185211934)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In185211934, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In185211934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185211934, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185211934} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In185211934, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out185211934|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In185211934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185211934, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185211934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:23:57,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:23:57,900 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d50cf840-3c1d-4459-a7e0-fa5955370521/bin/uautomizer/witness.graphml [2019-12-07 14:23:57,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:23:57,901 INFO L168 Benchmark]: Toolchain (without parser) took 8890.07 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 471.3 MB). Free memory was 939.8 MB in the beginning and 1.0 GB in the end (delta: -71.2 MB). Peak memory consumption was 400.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:57,901 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:23:57,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:57,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:57,902 INFO L168 Benchmark]: Boogie Preprocessor took 25.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:23:57,902 INFO L168 Benchmark]: RCFGBuilder took 380.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:57,903 INFO L168 Benchmark]: TraceAbstraction took 8026.36 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 373.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -20.0 MB). Peak memory consumption was 353.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:57,903 INFO L168 Benchmark]: Witness Printer took 54.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:23:57,905 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 380.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8026.36 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 373.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -20.0 MB). Peak memory consumption was 353.8 MB. Max. memory is 11.5 GB. * Witness Printer took 54.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1982 SDtfs, 2010 SDslu, 4251 SDs, 0 SdLazy, 2074 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11607occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 8103 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 413 ConstructedInterpolants, 0 QuantifiedInterpolants, 70096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...