./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.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_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/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 f5619558e548c3dd268cce0478a362a1364de920 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:38:35,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:38:35,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:38:35,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:38:35,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:38:35,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:38:35,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:38:35,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:38:35,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:38:35,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:38:35,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:38:35,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:38:35,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:38:35,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:38:35,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:38:35,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:38:35,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:38:35,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:38:35,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:38:35,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:38:35,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:38:35,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:38:35,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:38:35,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:38:35,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:38:35,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:38:35,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:38:35,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:38:35,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:38:35,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:38:35,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:38:35,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:38:35,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:38:35,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:38:35,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:38:35,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:38:35,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:38:35,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:38:35,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:38:35,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:38:35,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:38:35,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:38:35,440 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:38:35,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:38:35,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:38:35,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:38:35,441 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:38:35,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:38:35,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:38:35,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:38:35,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:38:35,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:38:35,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:38:35,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:38:35,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:38:35,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:38:35,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:38:35,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:38:35,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:38:35,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:38:35,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:38:35,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:38:35,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:38:35,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:38:35,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:38:35,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:38:35,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:38:35,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:38:35,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:38:35,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:38:35,446 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:38:35,446 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_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/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 -> f5619558e548c3dd268cce0478a362a1364de920 [2019-12-07 12:38:35,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:38:35,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:38:35,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:38:35,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:38:35,566 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:38:35,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc.i [2019-12-07 12:38:35,604 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/data/f201dc64d/2326c4c0817c4004a2abe32e9478e45d/FLAG2962d9568 [2019-12-07 12:38:35,958 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:38:35,958 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/sv-benchmarks/c/pthread-wmm/rfi001_power.oepc.i [2019-12-07 12:38:35,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/data/f201dc64d/2326c4c0817c4004a2abe32e9478e45d/FLAG2962d9568 [2019-12-07 12:38:35,978 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/data/f201dc64d/2326c4c0817c4004a2abe32e9478e45d [2019-12-07 12:38:35,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:38:35,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:38:35,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:38:35,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:38:35,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:38:35,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:38:35" (1/1) ... [2019-12-07 12:38:35,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778eab49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:35, skipping insertion in model container [2019-12-07 12:38:35,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:38:35" (1/1) ... [2019-12-07 12:38:35,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:38:36,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:38:36,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:38:36,263 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:38:36,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:38:36,353 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:38:36,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36 WrapperNode [2019-12-07 12:38:36,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:38:36,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:38:36,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:38:36,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:38:36,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... [2019-12-07 12:38:36,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... [2019-12-07 12:38:36,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:38:36,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:38:36,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:38:36,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:38:36,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... [2019-12-07 12:38:36,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... [2019-12-07 12:38:36,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... [2019-12-07 12:38:36,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... [2019-12-07 12:38:36,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... [2019-12-07 12:38:36,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... [2019-12-07 12:38:36,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... [2019-12-07 12:38:36,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:38:36,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:38:36,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:38:36,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:38:36,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/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 12:38:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:38:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:38:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:38:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:38:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:38:36,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:38:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:38:36,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:38:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:38:36,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:38:36,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:38:36,462 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 12:38:36,790 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:38:36,790 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:38:36,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:38:36 BoogieIcfgContainer [2019-12-07 12:38:36,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:38:36,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:38:36,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:38:36,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:38:36,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:38:35" (1/3) ... [2019-12-07 12:38:36,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215daca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:38:36, skipping insertion in model container [2019-12-07 12:38:36,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:38:36" (2/3) ... [2019-12-07 12:38:36,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215daca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:38:36, skipping insertion in model container [2019-12-07 12:38:36,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:38:36" (3/3) ... [2019-12-07 12:38:36,795 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc.i [2019-12-07 12:38:36,801 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:38:36,801 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:38:36,806 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:38:36,806 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:38:36,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,830 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,830 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,830 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,835 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,835 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:38:36,857 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:38:36,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:38:36,869 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:38:36,869 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:38:36,869 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:38:36,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:38:36,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:38:36,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:38:36,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:38:36,880 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-07 12:38:36,881 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 12:38:36,928 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 12:38:36,928 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:38:36,936 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 575 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:38:36,947 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-07 12:38:36,973 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-07 12:38:36,973 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:38:36,976 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 575 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:38:36,987 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 12:38:36,988 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:38:39,384 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 12:38:39,707 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76598 [2019-12-07 12:38:39,708 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 12:38:39,710 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-07 12:38:40,061 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 12:38:40,063 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 12:38:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:38:40,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:40,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:38:40,068 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:40,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:40,072 INFO L82 PathProgramCache]: Analyzing trace with hash 791334, now seen corresponding path program 1 times [2019-12-07 12:38:40,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:40,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974297823] [2019-12-07 12:38:40,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:40,213 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 12:38:40,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974297823] [2019-12-07 12:38:40,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:40,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:38:40,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585631007] [2019-12-07 12:38:40,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:38:40,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:38:40,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:38:40,230 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 12:38:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:40,413 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-07 12:38:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:38:40,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:38:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:40,484 INFO L225 Difference]: With dead ends: 8506 [2019-12-07 12:38:40,484 INFO L226 Difference]: Without dead ends: 7522 [2019-12-07 12:38:40,485 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 12:38:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-07 12:38:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-07 12:38:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-07 12:38:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-07 12:38:40,746 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-07 12:38:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:40,746 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-07 12:38:40,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:38:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-07 12:38:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:38:40,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:40,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:40,749 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash -894599256, now seen corresponding path program 1 times [2019-12-07 12:38:40,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:40,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059544489] [2019-12-07 12:38:40,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:40,816 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 12:38:40,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059544489] [2019-12-07 12:38:40,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:40,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:38:40,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108829853] [2019-12-07 12:38:40,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:38:40,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:38:40,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:38:40,818 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 4 states. [2019-12-07 12:38:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:41,031 INFO L93 Difference]: Finished difference Result 11740 states and 36692 transitions. [2019-12-07 12:38:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:38:41,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:38:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:41,084 INFO L225 Difference]: With dead ends: 11740 [2019-12-07 12:38:41,084 INFO L226 Difference]: Without dead ends: 11726 [2019-12-07 12:38:41,085 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 12:38:41,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11726 states. [2019-12-07 12:38:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11726 to 10436. [2019-12-07 12:38:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10436 states. [2019-12-07 12:38:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10436 states to 10436 states and 33285 transitions. [2019-12-07 12:38:41,354 INFO L78 Accepts]: Start accepts. Automaton has 10436 states and 33285 transitions. Word has length 11 [2019-12-07 12:38:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:41,354 INFO L462 AbstractCegarLoop]: Abstraction has 10436 states and 33285 transitions. [2019-12-07 12:38:41,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:38:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 10436 states and 33285 transitions. [2019-12-07 12:38:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:38:41,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:41,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:41,358 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:41,359 INFO L82 PathProgramCache]: Analyzing trace with hash 253726612, now seen corresponding path program 1 times [2019-12-07 12:38:41,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:41,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443961964] [2019-12-07 12:38:41,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:41,394 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 12:38:41,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443961964] [2019-12-07 12:38:41,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:41,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:38:41,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291773684] [2019-12-07 12:38:41,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:38:41,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:41,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:38:41,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:38:41,395 INFO L87 Difference]: Start difference. First operand 10436 states and 33285 transitions. Second operand 3 states. [2019-12-07 12:38:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:41,477 INFO L93 Difference]: Finished difference Result 15866 states and 49520 transitions. [2019-12-07 12:38:41,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:38:41,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 12:38:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:41,516 INFO L225 Difference]: With dead ends: 15866 [2019-12-07 12:38:41,516 INFO L226 Difference]: Without dead ends: 15866 [2019-12-07 12:38:41,516 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 12:38:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15866 states. [2019-12-07 12:38:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15866 to 11795. [2019-12-07 12:38:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11795 states. [2019-12-07 12:38:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11795 states to 11795 states and 37291 transitions. [2019-12-07 12:38:41,784 INFO L78 Accepts]: Start accepts. Automaton has 11795 states and 37291 transitions. Word has length 14 [2019-12-07 12:38:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:41,785 INFO L462 AbstractCegarLoop]: Abstraction has 11795 states and 37291 transitions. [2019-12-07 12:38:41,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:38:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 11795 states and 37291 transitions. [2019-12-07 12:38:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:38:41,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:41,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:41,787 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash 164472776, now seen corresponding path program 1 times [2019-12-07 12:38:41,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:41,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210871590] [2019-12-07 12:38:41,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:41,827 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 12:38:41,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210871590] [2019-12-07 12:38:41,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:41,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:38:41,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735468125] [2019-12-07 12:38:41,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:38:41,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:41,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:38:41,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:38:41,829 INFO L87 Difference]: Start difference. First operand 11795 states and 37291 transitions. Second operand 4 states. [2019-12-07 12:38:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:42,005 INFO L93 Difference]: Finished difference Result 14131 states and 44142 transitions. [2019-12-07 12:38:42,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:38:42,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:38:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:42,027 INFO L225 Difference]: With dead ends: 14131 [2019-12-07 12:38:42,027 INFO L226 Difference]: Without dead ends: 14131 [2019-12-07 12:38:42,027 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 12:38:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14131 states. [2019-12-07 12:38:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14131 to 12855. [2019-12-07 12:38:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12855 states. [2019-12-07 12:38:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 40501 transitions. [2019-12-07 12:38:42,243 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 40501 transitions. Word has length 14 [2019-12-07 12:38:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:42,243 INFO L462 AbstractCegarLoop]: Abstraction has 12855 states and 40501 transitions. [2019-12-07 12:38:42,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:38:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 40501 transitions. [2019-12-07 12:38:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:38:42,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:42,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:42,245 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash 930242268, now seen corresponding path program 1 times [2019-12-07 12:38:42,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:42,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427327005] [2019-12-07 12:38:42,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:42,282 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 12:38:42,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427327005] [2019-12-07 12:38:42,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:42,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:38:42,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386531646] [2019-12-07 12:38:42,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:38:42,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:42,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:38:42,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:38:42,283 INFO L87 Difference]: Start difference. First operand 12855 states and 40501 transitions. Second operand 4 states. [2019-12-07 12:38:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:42,427 INFO L93 Difference]: Finished difference Result 15545 states and 48643 transitions. [2019-12-07 12:38:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:38:42,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:38:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:42,448 INFO L225 Difference]: With dead ends: 15545 [2019-12-07 12:38:42,449 INFO L226 Difference]: Without dead ends: 15545 [2019-12-07 12:38:42,449 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 12:38:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2019-12-07 12:38:42,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 13090. [2019-12-07 12:38:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-12-07 12:38:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41334 transitions. [2019-12-07 12:38:42,726 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41334 transitions. Word has length 14 [2019-12-07 12:38:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:42,726 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41334 transitions. [2019-12-07 12:38:42,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:38:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41334 transitions. [2019-12-07 12:38:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:38:42,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:42,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:42,729 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash 929928555, now seen corresponding path program 1 times [2019-12-07 12:38:42,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:42,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106033795] [2019-12-07 12:38:42,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:42,792 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 12:38:42,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106033795] [2019-12-07 12:38:42,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:42,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:38:42,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193250733] [2019-12-07 12:38:42,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:38:42,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:38:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:38:42,793 INFO L87 Difference]: Start difference. First operand 13090 states and 41334 transitions. Second operand 3 states. [2019-12-07 12:38:42,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:42,832 INFO L93 Difference]: Finished difference Result 13090 states and 40732 transitions. [2019-12-07 12:38:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:38:42,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:38:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:42,849 INFO L225 Difference]: With dead ends: 13090 [2019-12-07 12:38:42,849 INFO L226 Difference]: Without dead ends: 13090 [2019-12-07 12:38:42,849 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 12:38:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13090 states. [2019-12-07 12:38:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13090 to 13010. [2019-12-07 12:38:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13010 states. [2019-12-07 12:38:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13010 states to 13010 states and 40500 transitions. [2019-12-07 12:38:43,059 INFO L78 Accepts]: Start accepts. Automaton has 13010 states and 40500 transitions. Word has length 16 [2019-12-07 12:38:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:43,059 INFO L462 AbstractCegarLoop]: Abstraction has 13010 states and 40500 transitions. [2019-12-07 12:38:43,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:38:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 13010 states and 40500 transitions. [2019-12-07 12:38:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:38:43,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:43,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:43,062 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:43,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1402616714, now seen corresponding path program 1 times [2019-12-07 12:38:43,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:43,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792857862] [2019-12-07 12:38:43,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:43,094 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 12:38:43,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792857862] [2019-12-07 12:38:43,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:43,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:38:43,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682725466] [2019-12-07 12:38:43,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:38:43,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:43,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:38:43,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:38:43,095 INFO L87 Difference]: Start difference. First operand 13010 states and 40500 transitions. Second operand 3 states. [2019-12-07 12:38:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:43,136 INFO L93 Difference]: Finished difference Result 13007 states and 40491 transitions. [2019-12-07 12:38:43,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:38:43,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:38:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:43,153 INFO L225 Difference]: With dead ends: 13007 [2019-12-07 12:38:43,154 INFO L226 Difference]: Without dead ends: 13007 [2019-12-07 12:38:43,154 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 12:38:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13007 states. [2019-12-07 12:38:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13007 to 13007. [2019-12-07 12:38:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13007 states. [2019-12-07 12:38:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 40491 transitions. [2019-12-07 12:38:43,354 INFO L78 Accepts]: Start accepts. Automaton has 13007 states and 40491 transitions. Word has length 16 [2019-12-07 12:38:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:43,354 INFO L462 AbstractCegarLoop]: Abstraction has 13007 states and 40491 transitions. [2019-12-07 12:38:43,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:38:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 13007 states and 40491 transitions. [2019-12-07 12:38:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:38:43,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:43,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:43,358 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:43,358 INFO L82 PathProgramCache]: Analyzing trace with hash 570123844, now seen corresponding path program 1 times [2019-12-07 12:38:43,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:43,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517811244] [2019-12-07 12:38:43,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:43,383 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 12:38:43,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517811244] [2019-12-07 12:38:43,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:43,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:38:43,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617005898] [2019-12-07 12:38:43,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:38:43,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:43,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:38:43,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:38:43,384 INFO L87 Difference]: Start difference. First operand 13007 states and 40491 transitions. Second operand 3 states. [2019-12-07 12:38:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:43,393 INFO L93 Difference]: Finished difference Result 1722 states and 3804 transitions. [2019-12-07 12:38:43,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:38:43,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:38:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:43,395 INFO L225 Difference]: With dead ends: 1722 [2019-12-07 12:38:43,395 INFO L226 Difference]: Without dead ends: 1722 [2019-12-07 12:38:43,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 12:38:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-12-07 12:38:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2019-12-07 12:38:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-12-07 12:38:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 3804 transitions. [2019-12-07 12:38:43,414 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 3804 transitions. Word has length 17 [2019-12-07 12:38:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:43,414 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 3804 transitions. [2019-12-07 12:38:43,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:38:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3804 transitions. [2019-12-07 12:38:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:38:43,416 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:43,416 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] [2019-12-07 12:38:43,416 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1533455323, now seen corresponding path program 1 times [2019-12-07 12:38:43,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:43,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327482000] [2019-12-07 12:38:43,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:43,465 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 12:38:43,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327482000] [2019-12-07 12:38:43,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:43,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:38:43,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309193055] [2019-12-07 12:38:43,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:38:43,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:38:43,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:43,467 INFO L87 Difference]: Start difference. First operand 1722 states and 3804 transitions. Second operand 5 states. [2019-12-07 12:38:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:43,621 INFO L93 Difference]: Finished difference Result 2256 states and 4866 transitions. [2019-12-07 12:38:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:38:43,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 12:38:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:43,623 INFO L225 Difference]: With dead ends: 2256 [2019-12-07 12:38:43,623 INFO L226 Difference]: Without dead ends: 2256 [2019-12-07 12:38:43,624 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 12:38:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2019-12-07 12:38:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1793. [2019-12-07 12:38:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2019-12-07 12:38:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 3950 transitions. [2019-12-07 12:38:43,648 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 3950 transitions. Word has length 25 [2019-12-07 12:38:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:43,649 INFO L462 AbstractCegarLoop]: Abstraction has 1793 states and 3950 transitions. [2019-12-07 12:38:43,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:38:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3950 transitions. [2019-12-07 12:38:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:38:43,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:43,651 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] [2019-12-07 12:38:43,651 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:43,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash -381413792, now seen corresponding path program 1 times [2019-12-07 12:38:43,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:43,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523829714] [2019-12-07 12:38:43,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:43,684 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 12:38:43,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523829714] [2019-12-07 12:38:43,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:43,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:38:43,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867195684] [2019-12-07 12:38:43,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:38:43,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:38:43,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:38:43,685 INFO L87 Difference]: Start difference. First operand 1793 states and 3950 transitions. Second operand 3 states. [2019-12-07 12:38:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:43,714 INFO L93 Difference]: Finished difference Result 2413 states and 5091 transitions. [2019-12-07 12:38:43,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:38:43,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 12:38:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:43,716 INFO L225 Difference]: With dead ends: 2413 [2019-12-07 12:38:43,716 INFO L226 Difference]: Without dead ends: 2413 [2019-12-07 12:38:43,716 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 12:38:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2019-12-07 12:38:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 1784. [2019-12-07 12:38:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-12-07 12:38:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 3784 transitions. [2019-12-07 12:38:43,739 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 3784 transitions. Word has length 25 [2019-12-07 12:38:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:43,739 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 3784 transitions. [2019-12-07 12:38:43,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:38:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3784 transitions. [2019-12-07 12:38:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:38:43,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:43,741 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 12:38:43,741 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash 501869478, now seen corresponding path program 1 times [2019-12-07 12:38:43,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:43,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386355008] [2019-12-07 12:38:43,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:43,812 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 12:38:43,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386355008] [2019-12-07 12:38:43,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:43,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:38:43,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731109021] [2019-12-07 12:38:43,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:38:43,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:43,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:38:43,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:38:43,813 INFO L87 Difference]: Start difference. First operand 1784 states and 3784 transitions. Second operand 5 states. [2019-12-07 12:38:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:43,957 INFO L93 Difference]: Finished difference Result 2202 states and 4613 transitions. [2019-12-07 12:38:43,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:38:43,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 12:38:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:43,959 INFO L225 Difference]: With dead ends: 2202 [2019-12-07 12:38:43,959 INFO L226 Difference]: Without dead ends: 2202 [2019-12-07 12:38:43,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 12:38:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2019-12-07 12:38:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1736. [2019-12-07 12:38:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-12-07 12:38:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 3685 transitions. [2019-12-07 12:38:43,974 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 3685 transitions. Word has length 26 [2019-12-07 12:38:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:43,974 INFO L462 AbstractCegarLoop]: Abstraction has 1736 states and 3685 transitions. [2019-12-07 12:38:43,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:38:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 3685 transitions. [2019-12-07 12:38:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:38:43,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:43,976 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 12:38:43,976 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:43,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:43,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1480384559, now seen corresponding path program 1 times [2019-12-07 12:38:43,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:43,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972509075] [2019-12-07 12:38:43,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:44,001 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 12:38:44,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972509075] [2019-12-07 12:38:44,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:44,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:38:44,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354461667] [2019-12-07 12:38:44,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:38:44,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:44,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:38:44,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:38:44,002 INFO L87 Difference]: Start difference. First operand 1736 states and 3685 transitions. Second operand 4 states. [2019-12-07 12:38:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:44,011 INFO L93 Difference]: Finished difference Result 846 states and 1773 transitions. [2019-12-07 12:38:44,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:38:44,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 12:38:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:44,012 INFO L225 Difference]: With dead ends: 846 [2019-12-07 12:38:44,012 INFO L226 Difference]: Without dead ends: 846 [2019-12-07 12:38:44,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:38:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-12-07 12:38:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 840. [2019-12-07 12:38:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 12:38:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1762 transitions. [2019-12-07 12:38:44,019 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1762 transitions. Word has length 27 [2019-12-07 12:38:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:44,019 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1762 transitions. [2019-12-07 12:38:44,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:38:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1762 transitions. [2019-12-07 12:38:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:38:44,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:44,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:44,021 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1729344618, now seen corresponding path program 1 times [2019-12-07 12:38:44,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:44,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294885646] [2019-12-07 12:38:44,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:44,069 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 12:38:44,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294885646] [2019-12-07 12:38:44,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:44,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:38:44,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124024132] [2019-12-07 12:38:44,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:38:44,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:44,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:38:44,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:38:44,070 INFO L87 Difference]: Start difference. First operand 840 states and 1762 transitions. Second operand 3 states. [2019-12-07 12:38:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:44,104 INFO L93 Difference]: Finished difference Result 1068 states and 2239 transitions. [2019-12-07 12:38:44,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:38:44,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 12:38:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:44,106 INFO L225 Difference]: With dead ends: 1068 [2019-12-07 12:38:44,106 INFO L226 Difference]: Without dead ends: 1068 [2019-12-07 12:38:44,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 12:38:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-12-07 12:38:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 826. [2019-12-07 12:38:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-07 12:38:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1752 transitions. [2019-12-07 12:38:44,117 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1752 transitions. Word has length 52 [2019-12-07 12:38:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:44,117 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1752 transitions. [2019-12-07 12:38:44,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:38:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1752 transitions. [2019-12-07 12:38:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:38:44,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:44,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:44,119 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:44,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:44,119 INFO L82 PathProgramCache]: Analyzing trace with hash -486023076, now seen corresponding path program 1 times [2019-12-07 12:38:44,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:44,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338145876] [2019-12-07 12:38:44,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:44,344 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 12:38:44,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338145876] [2019-12-07 12:38:44,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:44,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:38:44,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146315892] [2019-12-07 12:38:44,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:38:44,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:44,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:38:44,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:38:44,346 INFO L87 Difference]: Start difference. First operand 826 states and 1752 transitions. Second operand 12 states. [2019-12-07 12:38:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:46,277 INFO L93 Difference]: Finished difference Result 4240 states and 8615 transitions. [2019-12-07 12:38:46,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 12:38:46,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 12:38:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:46,279 INFO L225 Difference]: With dead ends: 4240 [2019-12-07 12:38:46,279 INFO L226 Difference]: Without dead ends: 2079 [2019-12-07 12:38:46,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1256, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 12:38:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-12-07 12:38:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 872. [2019-12-07 12:38:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-12-07 12:38:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1846 transitions. [2019-12-07 12:38:46,289 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1846 transitions. Word has length 53 [2019-12-07 12:38:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:46,290 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1846 transitions. [2019-12-07 12:38:46,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:38:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1846 transitions. [2019-12-07 12:38:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:38:46,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:46,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:46,291 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:46,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:46,291 INFO L82 PathProgramCache]: Analyzing trace with hash 940436030, now seen corresponding path program 2 times [2019-12-07 12:38:46,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:46,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771014834] [2019-12-07 12:38:46,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:46,480 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 12:38:46,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771014834] [2019-12-07 12:38:46,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:46,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:38:46,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583026739] [2019-12-07 12:38:46,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:38:46,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:38:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:38:46,481 INFO L87 Difference]: Start difference. First operand 872 states and 1846 transitions. Second operand 13 states. [2019-12-07 12:38:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:49,829 INFO L93 Difference]: Finished difference Result 2804 states and 5681 transitions. [2019-12-07 12:38:49,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 12:38:49,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-07 12:38:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:49,832 INFO L225 Difference]: With dead ends: 2804 [2019-12-07 12:38:49,832 INFO L226 Difference]: Without dead ends: 2073 [2019-12-07 12:38:49,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 12:38:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2019-12-07 12:38:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 872. [2019-12-07 12:38:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-12-07 12:38:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1845 transitions. [2019-12-07 12:38:49,853 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1845 transitions. Word has length 53 [2019-12-07 12:38:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:49,854 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1845 transitions. [2019-12-07 12:38:49,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:38:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1845 transitions. [2019-12-07 12:38:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:38:49,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:49,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:49,856 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:49,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:49,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1157705628, now seen corresponding path program 3 times [2019-12-07 12:38:49,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:49,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641232852] [2019-12-07 12:38:49,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:38:50,053 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 12:38:50,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641232852] [2019-12-07 12:38:50,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:38:50,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:38:50,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576690002] [2019-12-07 12:38:50,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:38:50,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:38:50,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:38:50,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:38:50,054 INFO L87 Difference]: Start difference. First operand 872 states and 1845 transitions. Second operand 13 states. [2019-12-07 12:38:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:38:51,562 INFO L93 Difference]: Finished difference Result 2670 states and 5516 transitions. [2019-12-07 12:38:51,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 12:38:51,562 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-07 12:38:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:38:51,564 INFO L225 Difference]: With dead ends: 2670 [2019-12-07 12:38:51,564 INFO L226 Difference]: Without dead ends: 1919 [2019-12-07 12:38:51,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 12:38:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-12-07 12:38:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 872. [2019-12-07 12:38:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-12-07 12:38:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1844 transitions. [2019-12-07 12:38:51,574 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1844 transitions. Word has length 53 [2019-12-07 12:38:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:38:51,574 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1844 transitions. [2019-12-07 12:38:51,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:38:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1844 transitions. [2019-12-07 12:38:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:38:51,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:38:51,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:38:51,576 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:38:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:38:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1920865598, now seen corresponding path program 4 times [2019-12-07 12:38:51,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:38:51,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134862855] [2019-12-07 12:38:51,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:38:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:38:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:38:51,644 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:38:51,644 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:38:51,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_31|)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1601~0.base_31|) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1601~0.base_31| 4)) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= 0 |v_ULTIMATE.start_main_~#t1601~0.offset_23|) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_31| 1)) (= 0 v_~x$r_buff0_thd2~0_279) (= 0 v_~x~0_116) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1601~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1601~0.base_31|) |v_ULTIMATE.start_main_~#t1601~0.offset_23| 0))) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1601~0.base=|v_ULTIMATE.start_main_~#t1601~0.base_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_19|, ULTIMATE.start_main_~#t1601~0.offset=|v_ULTIMATE.start_main_~#t1601~0.offset_23|, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1602~0.base, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1601~0.base, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1601~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1602~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:38:51,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~x$r_buff1_thd2~0_Out1456819845 ~x$r_buff0_thd2~0_In1456819845) (= ~x$r_buff0_thd1~0_Out1456819845 1) (= ~x$r_buff0_thd1~0_In1456819845 ~x$r_buff1_thd1~0_Out1456819845) (= 1 ~y~0_Out1456819845) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1456819845 0)) (= ~x$r_buff1_thd0~0_Out1456819845 ~x$r_buff0_thd0~0_In1456819845)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1456819845, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1456819845, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1456819845, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1456819845} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1456819845, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1456819845, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1456819845, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1456819845, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1456819845, ~y~0=~y~0_Out1456819845, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1456819845, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1456819845} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:38:51,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11|) |v_ULTIMATE.start_main_~#t1602~0.offset_10| 1)) |v_#memory_int_5|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1602~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1602~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1602~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1602~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1602~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1602~0.offset] because there is no mapped edge [2019-12-07 12:38:51,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In131135957 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In131135957 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out131135957|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In131135957 |P0Thread1of1ForFork0_#t~ite5_Out131135957|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In131135957, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131135957} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out131135957|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In131135957, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131135957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:38:51,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In954182915 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In954182915 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In954182915 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In954182915 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out954182915|)) (and (= ~x$w_buff1_used~0_In954182915 |P0Thread1of1ForFork0_#t~ite6_Out954182915|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In954182915, ~x$w_buff1_used~0=~x$w_buff1_used~0_In954182915, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In954182915, ~x$w_buff0_used~0=~x$w_buff0_used~0_In954182915} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out954182915|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In954182915, ~x$w_buff1_used~0=~x$w_buff1_used~0_In954182915, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In954182915, ~x$w_buff0_used~0=~x$w_buff0_used~0_In954182915} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:38:51,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= ~x$r_buff0_thd1~0_In-474957899 ~x$r_buff0_thd1~0_Out-474957899)) (.cse2 (= (mod ~x$w_buff0_used~0_In-474957899 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-474957899 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-474957899)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-474957899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-474957899} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-474957899, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-474957899|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-474957899} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:38:51,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd1~0_In448451046 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In448451046 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In448451046 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In448451046 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out448451046| ~x$r_buff1_thd1~0_In448451046) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out448451046| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In448451046, ~x$w_buff1_used~0=~x$w_buff1_used~0_In448451046, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In448451046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In448451046} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In448451046, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out448451046|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In448451046, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In448451046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In448451046} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:38:51,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 12:38:51,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 12:38:51,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1729202199 256)))) (or (and (= ~x$r_buff1_thd2~0_In1729202199 |P1Thread1of1ForFork1_#t~ite30_Out1729202199|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1729202199| |P1Thread1of1ForFork1_#t~ite29_Out1729202199|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out1729202199| |P1Thread1of1ForFork1_#t~ite30_Out1729202199|) (= |P1Thread1of1ForFork1_#t~ite29_Out1729202199| ~x$r_buff1_thd2~0_In1729202199) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1729202199 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd2~0_In1729202199 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1729202199 256))) (= 0 (mod ~x$w_buff0_used~0_In1729202199 256))))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1729202199|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1729202199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1729202199, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1729202199, ~weak$$choice2~0=~weak$$choice2~0_In1729202199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1729202199} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1729202199|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1729202199|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1729202199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1729202199, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1729202199, ~weak$$choice2~0=~weak$$choice2~0_In1729202199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1729202199} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:38:51,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 12:38:51,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1004981193 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1004981193 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1004981193| ~x~0_In-1004981193) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1004981193| ~x$w_buff1~0_In-1004981193) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1004981193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1004981193, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1004981193, ~x~0=~x~0_In-1004981193} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1004981193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1004981193, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1004981193, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1004981193|, ~x~0=~x~0_In-1004981193} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:38:51,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 12:38:51,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2056941033 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2056941033 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2056941033 |P1Thread1of1ForFork1_#t~ite34_Out2056941033|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2056941033|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2056941033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2056941033} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2056941033|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2056941033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2056941033} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:38:51,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In993864076 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In993864076 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In993864076 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In993864076 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out993864076| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out993864076| ~x$w_buff1_used~0_In993864076) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In993864076, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In993864076, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In993864076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In993864076} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In993864076, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In993864076, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out993864076|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In993864076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In993864076} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:38:51,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1001931267 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1001931267 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1001931267| ~x$r_buff0_thd2~0_In-1001931267) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1001931267| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001931267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001931267} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001931267, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1001931267|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001931267} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:38:51,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In799190554 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In799190554 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In799190554 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In799190554 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out799190554| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In799190554 |P1Thread1of1ForFork1_#t~ite37_Out799190554|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In799190554, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In799190554, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In799190554, ~x$w_buff0_used~0=~x$w_buff0_used~0_In799190554} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In799190554, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In799190554, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In799190554, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out799190554|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In799190554} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:38:51,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:38:51,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:38:51,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-598227223| |ULTIMATE.start_main_#t~ite41_Out-598227223|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-598227223 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-598227223 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-598227223| ~x$w_buff1~0_In-598227223) .cse2) (and (= |ULTIMATE.start_main_#t~ite40_Out-598227223| ~x~0_In-598227223) .cse2 (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-598227223, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-598227223, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-598227223, ~x~0=~x~0_In-598227223} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-598227223|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-598227223|, ~x$w_buff1~0=~x$w_buff1~0_In-598227223, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-598227223, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-598227223, ~x~0=~x~0_In-598227223} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:38:51,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2016912808 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2016912808 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out2016912808| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In2016912808 |ULTIMATE.start_main_#t~ite42_Out2016912808|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2016912808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2016912808} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2016912808, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2016912808|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2016912808} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:38:51,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1021789821 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1021789821 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1021789821 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1021789821 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1021789821| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite43_Out1021789821| ~x$w_buff1_used~0_In1021789821) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1021789821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1021789821, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1021789821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1021789821} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1021789821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1021789821, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1021789821|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1021789821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1021789821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:38:51,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In468237187 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In468237187 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out468237187|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In468237187 |ULTIMATE.start_main_#t~ite44_Out468237187|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In468237187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In468237187} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In468237187, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out468237187|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In468237187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:38:51,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1637898096 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1637898096 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1637898096 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1637898096 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1637898096| ~x$r_buff1_thd0~0_In1637898096) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out1637898096| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1637898096, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1637898096, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1637898096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1637898096} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1637898096, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1637898096, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1637898096, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1637898096|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1637898096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:38:51,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:38:51,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:38:51 BasicIcfg [2019-12-07 12:38:51,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:38:51,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:38:51,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:38:51,699 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:38:51,700 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:38:36" (3/4) ... [2019-12-07 12:38:51,701 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:38:51,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_31|)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1601~0.base_31|) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1601~0.base_31| 4)) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= 0 |v_ULTIMATE.start_main_~#t1601~0.offset_23|) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_31| 1)) (= 0 v_~x$r_buff0_thd2~0_279) (= 0 v_~x~0_116) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1601~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1601~0.base_31|) |v_ULTIMATE.start_main_~#t1601~0.offset_23| 0))) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1601~0.base=|v_ULTIMATE.start_main_~#t1601~0.base_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_19|, ULTIMATE.start_main_~#t1601~0.offset=|v_ULTIMATE.start_main_~#t1601~0.offset_23|, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1602~0.base, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1601~0.base, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1601~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1602~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:38:51,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~x$r_buff1_thd2~0_Out1456819845 ~x$r_buff0_thd2~0_In1456819845) (= ~x$r_buff0_thd1~0_Out1456819845 1) (= ~x$r_buff0_thd1~0_In1456819845 ~x$r_buff1_thd1~0_Out1456819845) (= 1 ~y~0_Out1456819845) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1456819845 0)) (= ~x$r_buff1_thd0~0_Out1456819845 ~x$r_buff0_thd0~0_In1456819845)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1456819845, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1456819845, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1456819845, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1456819845} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1456819845, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1456819845, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1456819845, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1456819845, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1456819845, ~y~0=~y~0_Out1456819845, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1456819845, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1456819845} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:38:51,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11|) |v_ULTIMATE.start_main_~#t1602~0.offset_10| 1)) |v_#memory_int_5|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1602~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1602~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1602~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1602~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1602~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1602~0.offset] because there is no mapped edge [2019-12-07 12:38:51,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In131135957 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In131135957 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out131135957|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In131135957 |P0Thread1of1ForFork0_#t~ite5_Out131135957|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In131135957, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131135957} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out131135957|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In131135957, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131135957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:38:51,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In954182915 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In954182915 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In954182915 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In954182915 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out954182915|)) (and (= ~x$w_buff1_used~0_In954182915 |P0Thread1of1ForFork0_#t~ite6_Out954182915|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In954182915, ~x$w_buff1_used~0=~x$w_buff1_used~0_In954182915, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In954182915, ~x$w_buff0_used~0=~x$w_buff0_used~0_In954182915} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out954182915|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In954182915, ~x$w_buff1_used~0=~x$w_buff1_used~0_In954182915, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In954182915, ~x$w_buff0_used~0=~x$w_buff0_used~0_In954182915} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:38:51,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= ~x$r_buff0_thd1~0_In-474957899 ~x$r_buff0_thd1~0_Out-474957899)) (.cse2 (= (mod ~x$w_buff0_used~0_In-474957899 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-474957899 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-474957899)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-474957899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-474957899} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-474957899, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-474957899|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-474957899} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:38:51,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd1~0_In448451046 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In448451046 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In448451046 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In448451046 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out448451046| ~x$r_buff1_thd1~0_In448451046) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out448451046| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In448451046, ~x$w_buff1_used~0=~x$w_buff1_used~0_In448451046, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In448451046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In448451046} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In448451046, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out448451046|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In448451046, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In448451046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In448451046} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:38:51,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 12:38:51,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 12:38:51,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1729202199 256)))) (or (and (= ~x$r_buff1_thd2~0_In1729202199 |P1Thread1of1ForFork1_#t~ite30_Out1729202199|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1729202199| |P1Thread1of1ForFork1_#t~ite29_Out1729202199|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out1729202199| |P1Thread1of1ForFork1_#t~ite30_Out1729202199|) (= |P1Thread1of1ForFork1_#t~ite29_Out1729202199| ~x$r_buff1_thd2~0_In1729202199) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1729202199 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd2~0_In1729202199 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1729202199 256))) (= 0 (mod ~x$w_buff0_used~0_In1729202199 256))))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1729202199|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1729202199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1729202199, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1729202199, ~weak$$choice2~0=~weak$$choice2~0_In1729202199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1729202199} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1729202199|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1729202199|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1729202199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1729202199, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1729202199, ~weak$$choice2~0=~weak$$choice2~0_In1729202199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1729202199} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:38:51,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 12:38:51,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1004981193 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1004981193 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1004981193| ~x~0_In-1004981193) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1004981193| ~x$w_buff1~0_In-1004981193) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1004981193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1004981193, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1004981193, ~x~0=~x~0_In-1004981193} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1004981193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1004981193, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1004981193, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1004981193|, ~x~0=~x~0_In-1004981193} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:38:51,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 12:38:51,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2056941033 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2056941033 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2056941033 |P1Thread1of1ForFork1_#t~ite34_Out2056941033|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2056941033|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2056941033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2056941033} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2056941033|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2056941033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2056941033} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:38:51,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In993864076 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In993864076 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In993864076 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In993864076 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out993864076| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out993864076| ~x$w_buff1_used~0_In993864076) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In993864076, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In993864076, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In993864076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In993864076} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In993864076, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In993864076, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out993864076|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In993864076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In993864076} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:38:51,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1001931267 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1001931267 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1001931267| ~x$r_buff0_thd2~0_In-1001931267) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1001931267| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001931267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001931267} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001931267, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1001931267|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001931267} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:38:51,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In799190554 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In799190554 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In799190554 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In799190554 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out799190554| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In799190554 |P1Thread1of1ForFork1_#t~ite37_Out799190554|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In799190554, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In799190554, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In799190554, ~x$w_buff0_used~0=~x$w_buff0_used~0_In799190554} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In799190554, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In799190554, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In799190554, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out799190554|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In799190554} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:38:51,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:38:51,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:38:51,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-598227223| |ULTIMATE.start_main_#t~ite41_Out-598227223|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-598227223 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-598227223 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-598227223| ~x$w_buff1~0_In-598227223) .cse2) (and (= |ULTIMATE.start_main_#t~ite40_Out-598227223| ~x~0_In-598227223) .cse2 (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-598227223, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-598227223, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-598227223, ~x~0=~x~0_In-598227223} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-598227223|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-598227223|, ~x$w_buff1~0=~x$w_buff1~0_In-598227223, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-598227223, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-598227223, ~x~0=~x~0_In-598227223} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:38:51,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2016912808 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2016912808 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out2016912808| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In2016912808 |ULTIMATE.start_main_#t~ite42_Out2016912808|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2016912808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2016912808} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2016912808, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2016912808|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2016912808} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:38:51,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1021789821 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1021789821 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1021789821 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1021789821 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1021789821| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite43_Out1021789821| ~x$w_buff1_used~0_In1021789821) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1021789821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1021789821, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1021789821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1021789821} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1021789821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1021789821, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1021789821|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1021789821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1021789821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:38:51,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In468237187 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In468237187 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out468237187|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In468237187 |ULTIMATE.start_main_#t~ite44_Out468237187|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In468237187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In468237187} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In468237187, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out468237187|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In468237187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:38:51,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1637898096 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1637898096 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1637898096 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1637898096 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1637898096| ~x$r_buff1_thd0~0_In1637898096) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out1637898096| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1637898096, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1637898096, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1637898096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1637898096} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1637898096, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1637898096, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1637898096, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1637898096|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1637898096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:38:51,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:38:51,761 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2760b3c2-d4a5-45eb-97a1-df3dce3a0c2d/bin/uautomizer/witness.graphml [2019-12-07 12:38:51,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:38:51,762 INFO L168 Benchmark]: Toolchain (without parser) took 15781.07 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 558.4 MB). Free memory was 939.7 MB in the beginning and 1.2 GB in the end (delta: -287.0 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:51,762 INFO L168 Benchmark]: CDTParser took 0.16 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 12:38:51,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:51,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.09 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 12:38:51,763 INFO L168 Benchmark]: Boogie Preprocessor took 26.09 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 12:38:51,763 INFO L168 Benchmark]: RCFGBuilder took 372.67 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:51,764 INFO L168 Benchmark]: TraceAbstraction took 14907.22 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 459.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -233.9 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:51,764 INFO L168 Benchmark]: Witness Printer took 62.32 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:38:51,765 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.16 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 371.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.09 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 26.09 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 372.67 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14907.22 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 459.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -233.9 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. * Witness Printer took 62.32 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 25 ChoiceCompositions, 4597 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 76598 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2712 SDtfs, 2545 SDslu, 8001 SDs, 0 SdLazy, 8410 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 19 SyntacticMatches, 11 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13090occurred 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.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 14433 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 403 ConstructedInterpolants, 0 QuantifiedInterpolants, 97477 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...