./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe024_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe024_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/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 d8ee9361f952001523e18e33df3cc1597a21c4c8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:35:24,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:35:24,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:35:24,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:35:24,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:35:24,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:35:24,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:35:24,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:35:24,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:35:24,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:35:24,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:35:24,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:35:24,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:35:24,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:35:24,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:35:24,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:35:24,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:35:24,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:35:24,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:35:24,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:35:24,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:35:24,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:35:24,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:35:24,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:35:24,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:35:24,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:35:24,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:35:24,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:35:24,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:35:24,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:35:24,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:35:24,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:35:24,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:35:24,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:35:24,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:35:24,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:35:24,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:35:24,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:35:24,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:35:24,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:35:24,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:35:24,252 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:35:24,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:35:24,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:35:24,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:35:24,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:35:24,263 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:35:24,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:35:24,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:35:24,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:35:24,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:35:24,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:35:24,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:35:24,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:35:24,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:35:24,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:35:24,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:35:24,265 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:35:24,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:35:24,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:35:24,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:35:24,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:35:24,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:35:24,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:35:24,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:35:24,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:35:24,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:35:24,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:35:24,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:35:24,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:35:24,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:35:24,266 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_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/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 -> d8ee9361f952001523e18e33df3cc1597a21c4c8 [2019-12-07 14:35:24,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:35:24,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:35:24,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:35:24,381 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:35:24,381 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:35:24,382 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe024_pso.oepc.i [2019-12-07 14:35:24,419 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/data/283292c31/d580e1ebb922479abe01a71596cde89f/FLAG3be22034d [2019-12-07 14:35:24,887 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:35:24,888 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/sv-benchmarks/c/pthread-wmm/safe024_pso.oepc.i [2019-12-07 14:35:24,898 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/data/283292c31/d580e1ebb922479abe01a71596cde89f/FLAG3be22034d [2019-12-07 14:35:24,907 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/data/283292c31/d580e1ebb922479abe01a71596cde89f [2019-12-07 14:35:24,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:35:24,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:35:24,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:35:24,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:35:24,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:35:24,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:35:24" (1/1) ... [2019-12-07 14:35:24,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:24, skipping insertion in model container [2019-12-07 14:35:24,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:35:24" (1/1) ... [2019-12-07 14:35:24,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:35:24,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:35:25,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:35:25,200 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:35:25,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:35:25,291 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:35:25,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25 WrapperNode [2019-12-07 14:35:25,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:35:25,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:35:25,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:35:25,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:35:25,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... [2019-12-07 14:35:25,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... [2019-12-07 14:35:25,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:35:25,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:35:25,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:35:25,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:35:25,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... [2019-12-07 14:35:25,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... [2019-12-07 14:35:25,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... [2019-12-07 14:35:25,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... [2019-12-07 14:35:25,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... [2019-12-07 14:35:25,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... [2019-12-07 14:35:25,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... [2019-12-07 14:35:25,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:35:25,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:35:25,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:35:25,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:35:25,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:35:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:35:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:35:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:35:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:35:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:35:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:35:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:35:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:35:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:35:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:35:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:35:25,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:35:25,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:35:25,400 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:35:25,755 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:35:25,756 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:35:25,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:35:25 BoogieIcfgContainer [2019-12-07 14:35:25,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:35:25,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:35:25,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:35:25,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:35:25,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:35:24" (1/3) ... [2019-12-07 14:35:25,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15495afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:35:25, skipping insertion in model container [2019-12-07 14:35:25,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:35:25" (2/3) ... [2019-12-07 14:35:25,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15495afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:35:25, skipping insertion in model container [2019-12-07 14:35:25,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:35:25" (3/3) ... [2019-12-07 14:35:25,762 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.oepc.i [2019-12-07 14:35:25,768 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:35:25,769 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:35:25,773 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:35:25,774 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:35:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,813 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,813 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:35:25,827 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:35:25,840 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:35:25,840 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:35:25,840 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:35:25,840 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:35:25,840 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:35:25,840 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:35:25,840 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:35:25,840 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:35:25,851 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 14:35:25,852 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 14:35:25,903 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 14:35:25,904 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:35:25,914 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 14:35:25,929 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 14:35:25,957 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 14:35:25,958 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:35:25,963 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 14:35:25,978 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 14:35:25,979 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:35:29,100 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 14:35:29,185 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-07 14:35:29,185 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 14:35:29,187 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-07 14:35:38,801 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 14:35:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 14:35:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:35:38,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:38,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:35:38,807 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:38,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:38,810 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-07 14:35:38,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:38,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499020423] [2019-12-07 14:35:38,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:35:38,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499020423] [2019-12-07 14:35:38,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:38,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:35:38,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921635449] [2019-12-07 14:35:38,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:35:38,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:35:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:35:38,972 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 14:35:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:39,553 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-07 14:35:39,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:35:39,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:35:39,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:40,121 INFO L225 Difference]: With dead ends: 87834 [2019-12-07 14:35:40,121 INFO L226 Difference]: Without dead ends: 82738 [2019-12-07 14:35:40,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:35:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-07 14:35:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-07 14:35:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-07 14:35:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-07 14:35:44,855 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-07 14:35:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:44,856 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-07 14:35:44,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:35:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-07 14:35:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:35:44,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:44,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:35:44,863 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-07 14:35:44,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:44,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395024198] [2019-12-07 14:35:44,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:35:44,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395024198] [2019-12-07 14:35:44,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:44,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:35:44,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183555964] [2019-12-07 14:35:44,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:35:44,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:44,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:35:44,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:35:44,939 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-07 14:35:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:46,973 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-07 14:35:46,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:35:46,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:35:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:47,285 INFO L225 Difference]: With dead ends: 127286 [2019-12-07 14:35:47,286 INFO L226 Difference]: Without dead ends: 127202 [2019-12-07 14:35:47,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:35:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-07 14:35:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-07 14:35:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-07 14:35:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-07 14:35:53,021 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-07 14:35:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:35:53,022 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-07 14:35:53,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:35:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-07 14:35:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:35:53,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:35:53,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:35:53,024 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:35:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:35:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-07 14:35:53,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:35:53,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910155598] [2019-12-07 14:35:53,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:35:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:35:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:35:53,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910155598] [2019-12-07 14:35:53,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:35:53,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:35:53,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058793632] [2019-12-07 14:35:53,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:35:53,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:35:53,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:35:53,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:35:53,080 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 4 states. [2019-12-07 14:35:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:35:54,128 INFO L93 Difference]: Finished difference Result 162018 states and 656174 transitions. [2019-12-07 14:35:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:35:54,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:35:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:35:54,553 INFO L225 Difference]: With dead ends: 162018 [2019-12-07 14:35:54,554 INFO L226 Difference]: Without dead ends: 161922 [2019-12-07 14:35:54,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161922 states. [2019-12-07 14:36:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161922 to 136790. [2019-12-07 14:36:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136790 states. [2019-12-07 14:36:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136790 states to 136790 states and 563231 transitions. [2019-12-07 14:36:02,896 INFO L78 Accepts]: Start accepts. Automaton has 136790 states and 563231 transitions. Word has length 13 [2019-12-07 14:36:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:02,896 INFO L462 AbstractCegarLoop]: Abstraction has 136790 states and 563231 transitions. [2019-12-07 14:36:02,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 136790 states and 563231 transitions. [2019-12-07 14:36:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:36:02,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:02,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:02,899 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-07 14:36:02,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:02,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526522591] [2019-12-07 14:36:02,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:02,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526522591] [2019-12-07 14:36:02,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:02,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:36:02,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689240717] [2019-12-07 14:36:02,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:36:02,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:02,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:36:02,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:02,952 INFO L87 Difference]: Start difference. First operand 136790 states and 563231 transitions. Second operand 5 states. [2019-12-07 14:36:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:03,815 INFO L93 Difference]: Finished difference Result 183350 states and 741495 transitions. [2019-12-07 14:36:03,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:36:03,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 14:36:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:04,280 INFO L225 Difference]: With dead ends: 183350 [2019-12-07 14:36:04,280 INFO L226 Difference]: Without dead ends: 183222 [2019-12-07 14:36:04,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:36:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183222 states. [2019-12-07 14:36:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183222 to 144665. [2019-12-07 14:36:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144665 states. [2019-12-07 14:36:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144665 states to 144665 states and 594615 transitions. [2019-12-07 14:36:13,230 INFO L78 Accepts]: Start accepts. Automaton has 144665 states and 594615 transitions. Word has length 14 [2019-12-07 14:36:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:13,230 INFO L462 AbstractCegarLoop]: Abstraction has 144665 states and 594615 transitions. [2019-12-07 14:36:13,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:36:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 144665 states and 594615 transitions. [2019-12-07 14:36:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:36:13,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:13,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:13,254 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash -272588530, now seen corresponding path program 1 times [2019-12-07 14:36:13,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:13,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558709162] [2019-12-07 14:36:13,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:13,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558709162] [2019-12-07 14:36:13,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:13,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:36:13,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222070161] [2019-12-07 14:36:13,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:36:13,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:13,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:36:13,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:36:13,304 INFO L87 Difference]: Start difference. First operand 144665 states and 594615 transitions. Second operand 3 states. [2019-12-07 14:36:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:13,835 INFO L93 Difference]: Finished difference Result 136560 states and 554920 transitions. [2019-12-07 14:36:13,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:36:13,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:36:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:14,174 INFO L225 Difference]: With dead ends: 136560 [2019-12-07 14:36:14,174 INFO L226 Difference]: Without dead ends: 136560 [2019-12-07 14:36:14,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:36:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136560 states. [2019-12-07 14:36:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136560 to 133766. [2019-12-07 14:36:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133766 states. [2019-12-07 14:36:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133766 states to 133766 states and 544240 transitions. [2019-12-07 14:36:20,497 INFO L78 Accepts]: Start accepts. Automaton has 133766 states and 544240 transitions. Word has length 18 [2019-12-07 14:36:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:20,497 INFO L462 AbstractCegarLoop]: Abstraction has 133766 states and 544240 transitions. [2019-12-07 14:36:20,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:36:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 133766 states and 544240 transitions. [2019-12-07 14:36:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:36:20,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:20,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:20,509 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1006952862, now seen corresponding path program 1 times [2019-12-07 14:36:20,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:20,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830232165] [2019-12-07 14:36:20,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:20,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830232165] [2019-12-07 14:36:20,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:20,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:36:20,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997557939] [2019-12-07 14:36:20,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:36:20,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:20,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:36:20,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:36:20,566 INFO L87 Difference]: Start difference. First operand 133766 states and 544240 transitions. Second operand 3 states. [2019-12-07 14:36:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:21,059 INFO L93 Difference]: Finished difference Result 133775 states and 543179 transitions. [2019-12-07 14:36:21,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:36:21,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:36:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:21,385 INFO L225 Difference]: With dead ends: 133775 [2019-12-07 14:36:21,385 INFO L226 Difference]: Without dead ends: 133775 [2019-12-07 14:36:21,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:36:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133775 states. [2019-12-07 14:36:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133775 to 133083. [2019-12-07 14:36:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133083 states. [2019-12-07 14:36:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133083 states to 133083 states and 541395 transitions. [2019-12-07 14:36:27,365 INFO L78 Accepts]: Start accepts. Automaton has 133083 states and 541395 transitions. Word has length 18 [2019-12-07 14:36:27,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:27,366 INFO L462 AbstractCegarLoop]: Abstraction has 133083 states and 541395 transitions. [2019-12-07 14:36:27,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:36:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 133083 states and 541395 transitions. [2019-12-07 14:36:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:36:27,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:27,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:27,380 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:27,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash -406957021, now seen corresponding path program 1 times [2019-12-07 14:36:27,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:27,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815157005] [2019-12-07 14:36:27,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:27,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815157005] [2019-12-07 14:36:27,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:27,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:27,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897220987] [2019-12-07 14:36:27,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:36:27,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:36:27,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:36:27,453 INFO L87 Difference]: Start difference. First operand 133083 states and 541395 transitions. Second operand 6 states. [2019-12-07 14:36:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:28,402 INFO L93 Difference]: Finished difference Result 185091 states and 739995 transitions. [2019-12-07 14:36:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:36:28,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 14:36:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:30,759 INFO L225 Difference]: With dead ends: 185091 [2019-12-07 14:36:30,759 INFO L226 Difference]: Without dead ends: 184929 [2019-12-07 14:36:30,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:36:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184929 states. [2019-12-07 14:36:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184929 to 137823. [2019-12-07 14:36:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137823 states. [2019-12-07 14:36:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137823 states to 137823 states and 560108 transitions. [2019-12-07 14:36:37,339 INFO L78 Accepts]: Start accepts. Automaton has 137823 states and 560108 transitions. Word has length 19 [2019-12-07 14:36:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:37,340 INFO L462 AbstractCegarLoop]: Abstraction has 137823 states and 560108 transitions. [2019-12-07 14:36:37,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:36:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 137823 states and 560108 transitions. [2019-12-07 14:36:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:36:37,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:37,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:37,354 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:37,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2014973082, now seen corresponding path program 1 times [2019-12-07 14:36:37,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:37,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902406110] [2019-12-07 14:36:37,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:37,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 14:36:37,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902406110] [2019-12-07 14:36:37,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:37,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:36:37,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691353207] [2019-12-07 14:36:37,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:36:37,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:36:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:36:37,385 INFO L87 Difference]: Start difference. First operand 137823 states and 560108 transitions. Second operand 3 states. [2019-12-07 14:36:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:37,479 INFO L93 Difference]: Finished difference Result 31407 states and 102913 transitions. [2019-12-07 14:36:37,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:36:37,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 14:36:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:37,524 INFO L225 Difference]: With dead ends: 31407 [2019-12-07 14:36:37,524 INFO L226 Difference]: Without dead ends: 31407 [2019-12-07 14:36:37,524 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 14:36:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31407 states. [2019-12-07 14:36:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31407 to 31407. [2019-12-07 14:36:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31407 states. [2019-12-07 14:36:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31407 states to 31407 states and 102913 transitions. [2019-12-07 14:36:38,037 INFO L78 Accepts]: Start accepts. Automaton has 31407 states and 102913 transitions. Word has length 19 [2019-12-07 14:36:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:38,037 INFO L462 AbstractCegarLoop]: Abstraction has 31407 states and 102913 transitions. [2019-12-07 14:36:38,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:36:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31407 states and 102913 transitions. [2019-12-07 14:36:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:36:38,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:38,043 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] [2019-12-07 14:36:38,043 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-07 14:36:38,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:38,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360481210] [2019-12-07 14:36:38,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:38,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360481210] [2019-12-07 14:36:38,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:38,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:38,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130114379] [2019-12-07 14:36:38,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:36:38,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:36:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:36:38,111 INFO L87 Difference]: Start difference. First operand 31407 states and 102913 transitions. Second operand 6 states. [2019-12-07 14:36:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:38,745 INFO L93 Difference]: Finished difference Result 49222 states and 158706 transitions. [2019-12-07 14:36:38,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:36:38,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 14:36:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:38,823 INFO L225 Difference]: With dead ends: 49222 [2019-12-07 14:36:38,824 INFO L226 Difference]: Without dead ends: 49194 [2019-12-07 14:36:38,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:36:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49194 states. [2019-12-07 14:36:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49194 to 34152. [2019-12-07 14:36:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34152 states. [2019-12-07 14:36:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34152 states to 34152 states and 110783 transitions. [2019-12-07 14:36:39,525 INFO L78 Accepts]: Start accepts. Automaton has 34152 states and 110783 transitions. Word has length 22 [2019-12-07 14:36:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:39,526 INFO L462 AbstractCegarLoop]: Abstraction has 34152 states and 110783 transitions. [2019-12-07 14:36:39,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:36:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34152 states and 110783 transitions. [2019-12-07 14:36:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:36:39,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:39,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:39,537 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash -353872392, now seen corresponding path program 1 times [2019-12-07 14:36:39,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:39,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823072071] [2019-12-07 14:36:39,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:39,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823072071] [2019-12-07 14:36:39,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:39,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:39,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482318236] [2019-12-07 14:36:39,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:36:39,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:39,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:36:39,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:36:39,604 INFO L87 Difference]: Start difference. First operand 34152 states and 110783 transitions. Second operand 6 states. [2019-12-07 14:36:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:40,012 INFO L93 Difference]: Finished difference Result 51693 states and 167076 transitions. [2019-12-07 14:36:40,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:36:40,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 14:36:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:40,092 INFO L225 Difference]: With dead ends: 51693 [2019-12-07 14:36:40,092 INFO L226 Difference]: Without dead ends: 51650 [2019-12-07 14:36:40,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:36:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51650 states. [2019-12-07 14:36:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51650 to 35119. [2019-12-07 14:36:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35119 states. [2019-12-07 14:36:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35119 states to 35119 states and 113881 transitions. [2019-12-07 14:36:40,773 INFO L78 Accepts]: Start accepts. Automaton has 35119 states and 113881 transitions. Word has length 27 [2019-12-07 14:36:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:40,773 INFO L462 AbstractCegarLoop]: Abstraction has 35119 states and 113881 transitions. [2019-12-07 14:36:40,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:36:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 35119 states and 113881 transitions. [2019-12-07 14:36:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 14:36:40,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:40,792 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] [2019-12-07 14:36:40,792 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1453548976, now seen corresponding path program 1 times [2019-12-07 14:36:40,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:40,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747511228] [2019-12-07 14:36:40,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:40,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747511228] [2019-12-07 14:36:40,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:40,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:36:40,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762471143] [2019-12-07 14:36:40,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:40,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:40,826 INFO L87 Difference]: Start difference. First operand 35119 states and 113881 transitions. Second operand 4 states. [2019-12-07 14:36:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:40,868 INFO L93 Difference]: Finished difference Result 12708 states and 38667 transitions. [2019-12-07 14:36:40,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:40,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 14:36:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:40,882 INFO L225 Difference]: With dead ends: 12708 [2019-12-07 14:36:40,883 INFO L226 Difference]: Without dead ends: 12708 [2019-12-07 14:36:40,883 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 14:36:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12708 states. [2019-12-07 14:36:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12708 to 12463. [2019-12-07 14:36:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12463 states. [2019-12-07 14:36:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12463 states to 12463 states and 37932 transitions. [2019-12-07 14:36:41,062 INFO L78 Accepts]: Start accepts. Automaton has 12463 states and 37932 transitions. Word has length 30 [2019-12-07 14:36:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:41,062 INFO L462 AbstractCegarLoop]: Abstraction has 12463 states and 37932 transitions. [2019-12-07 14:36:41,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 12463 states and 37932 transitions. [2019-12-07 14:36:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:36:41,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:41,077 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] [2019-12-07 14:36:41,077 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:41,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-07 14:36:41,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:41,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85459940] [2019-12-07 14:36:41,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:41,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85459940] [2019-12-07 14:36:41,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:41,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:41,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147190273] [2019-12-07 14:36:41,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:36:41,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:41,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:36:41,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:41,121 INFO L87 Difference]: Start difference. First operand 12463 states and 37932 transitions. Second operand 5 states. [2019-12-07 14:36:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:41,162 INFO L93 Difference]: Finished difference Result 11047 states and 34500 transitions. [2019-12-07 14:36:41,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:36:41,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 14:36:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:41,174 INFO L225 Difference]: With dead ends: 11047 [2019-12-07 14:36:41,175 INFO L226 Difference]: Without dead ends: 11047 [2019-12-07 14:36:41,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11047 states. [2019-12-07 14:36:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11047 to 10241. [2019-12-07 14:36:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10241 states. [2019-12-07 14:36:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10241 states to 10241 states and 32106 transitions. [2019-12-07 14:36:41,325 INFO L78 Accepts]: Start accepts. Automaton has 10241 states and 32106 transitions. Word has length 39 [2019-12-07 14:36:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:41,325 INFO L462 AbstractCegarLoop]: Abstraction has 10241 states and 32106 transitions. [2019-12-07 14:36:41,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:36:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 10241 states and 32106 transitions. [2019-12-07 14:36:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:36:41,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:41,334 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, 1] [2019-12-07 14:36:41,334 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:41,334 INFO L82 PathProgramCache]: Analyzing trace with hash 565519894, now seen corresponding path program 1 times [2019-12-07 14:36:41,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:41,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252055366] [2019-12-07 14:36:41,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:41,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252055366] [2019-12-07 14:36:41,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:41,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:36:41,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666881293] [2019-12-07 14:36:41,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:36:41,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:41,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:36:41,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:41,395 INFO L87 Difference]: Start difference. First operand 10241 states and 32106 transitions. Second operand 5 states. [2019-12-07 14:36:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:41,655 INFO L93 Difference]: Finished difference Result 15008 states and 46346 transitions. [2019-12-07 14:36:41,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:36:41,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-07 14:36:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:41,672 INFO L225 Difference]: With dead ends: 15008 [2019-12-07 14:36:41,672 INFO L226 Difference]: Without dead ends: 15008 [2019-12-07 14:36:41,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:36:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15008 states. [2019-12-07 14:36:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15008 to 13213. [2019-12-07 14:36:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13213 states. [2019-12-07 14:36:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13213 states to 13213 states and 41162 transitions. [2019-12-07 14:36:41,873 INFO L78 Accepts]: Start accepts. Automaton has 13213 states and 41162 transitions. Word has length 54 [2019-12-07 14:36:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:41,873 INFO L462 AbstractCegarLoop]: Abstraction has 13213 states and 41162 transitions. [2019-12-07 14:36:41,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:36:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 13213 states and 41162 transitions. [2019-12-07 14:36:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:36:41,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:41,885 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, 1] [2019-12-07 14:36:41,885 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:41,885 INFO L82 PathProgramCache]: Analyzing trace with hash 95954180, now seen corresponding path program 2 times [2019-12-07 14:36:41,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:41,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064362542] [2019-12-07 14:36:41,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:41,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064362542] [2019-12-07 14:36:41,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:41,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:36:41,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501089358] [2019-12-07 14:36:41,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:41,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:41,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:41,942 INFO L87 Difference]: Start difference. First operand 13213 states and 41162 transitions. Second operand 4 states. [2019-12-07 14:36:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:42,007 INFO L93 Difference]: Finished difference Result 23703 states and 73898 transitions. [2019-12-07 14:36:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:36:42,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 14:36:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:42,042 INFO L225 Difference]: With dead ends: 23703 [2019-12-07 14:36:42,042 INFO L226 Difference]: Without dead ends: 22413 [2019-12-07 14:36:42,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22413 states. [2019-12-07 14:36:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22413 to 12833. [2019-12-07 14:36:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12833 states. [2019-12-07 14:36:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12833 states to 12833 states and 39947 transitions. [2019-12-07 14:36:42,355 INFO L78 Accepts]: Start accepts. Automaton has 12833 states and 39947 transitions. Word has length 54 [2019-12-07 14:36:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:42,355 INFO L462 AbstractCegarLoop]: Abstraction has 12833 states and 39947 transitions. [2019-12-07 14:36:42,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 12833 states and 39947 transitions. [2019-12-07 14:36:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:36:42,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:42,366 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, 1] [2019-12-07 14:36:42,366 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash 798244960, now seen corresponding path program 3 times [2019-12-07 14:36:42,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:42,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473037447] [2019-12-07 14:36:42,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:42,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473037447] [2019-12-07 14:36:42,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:42,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:36:42,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978369589] [2019-12-07 14:36:42,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:36:42,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:42,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:36:42,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:36:42,418 INFO L87 Difference]: Start difference. First operand 12833 states and 39947 transitions. Second operand 3 states. [2019-12-07 14:36:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:42,453 INFO L93 Difference]: Finished difference Result 12246 states and 37611 transitions. [2019-12-07 14:36:42,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:36:42,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 14:36:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:42,466 INFO L225 Difference]: With dead ends: 12246 [2019-12-07 14:36:42,466 INFO L226 Difference]: Without dead ends: 12246 [2019-12-07 14:36:42,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:36:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12246 states. [2019-12-07 14:36:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12246 to 11898. [2019-12-07 14:36:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11898 states. [2019-12-07 14:36:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11898 states to 11898 states and 36644 transitions. [2019-12-07 14:36:42,624 INFO L78 Accepts]: Start accepts. Automaton has 11898 states and 36644 transitions. Word has length 54 [2019-12-07 14:36:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:42,624 INFO L462 AbstractCegarLoop]: Abstraction has 11898 states and 36644 transitions. [2019-12-07 14:36:42,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:36:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11898 states and 36644 transitions. [2019-12-07 14:36:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:36:42,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:42,634 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, 1, 1] [2019-12-07 14:36:42,635 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1492343505, now seen corresponding path program 1 times [2019-12-07 14:36:42,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:42,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550510863] [2019-12-07 14:36:42,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:42,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550510863] [2019-12-07 14:36:42,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:42,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:36:42,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926416154] [2019-12-07 14:36:42,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:36:42,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:42,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:36:42,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:36:42,782 INFO L87 Difference]: Start difference. First operand 11898 states and 36644 transitions. Second operand 11 states. [2019-12-07 14:36:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:43,692 INFO L93 Difference]: Finished difference Result 50543 states and 155207 transitions. [2019-12-07 14:36:43,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 14:36:43,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 14:36:43,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:43,721 INFO L225 Difference]: With dead ends: 50543 [2019-12-07 14:36:43,721 INFO L226 Difference]: Without dead ends: 24713 [2019-12-07 14:36:43,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2019-12-07 14:36:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24713 states. [2019-12-07 14:36:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24713 to 12355. [2019-12-07 14:36:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12355 states. [2019-12-07 14:36:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12355 states to 12355 states and 38484 transitions. [2019-12-07 14:36:43,984 INFO L78 Accepts]: Start accepts. Automaton has 12355 states and 38484 transitions. Word has length 55 [2019-12-07 14:36:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:43,984 INFO L462 AbstractCegarLoop]: Abstraction has 12355 states and 38484 transitions. [2019-12-07 14:36:43,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:36:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 12355 states and 38484 transitions. [2019-12-07 14:36:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:36:43,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:43,995 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, 1, 1] [2019-12-07 14:36:43,995 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:43,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 2 times [2019-12-07 14:36:43,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:43,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648077658] [2019-12-07 14:36:43,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:44,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648077658] [2019-12-07 14:36:44,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:44,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:36:44,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182656564] [2019-12-07 14:36:44,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:36:44,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:36:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:36:44,168 INFO L87 Difference]: Start difference. First operand 12355 states and 38484 transitions. Second operand 12 states. [2019-12-07 14:36:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:45,423 INFO L93 Difference]: Finished difference Result 36329 states and 113056 transitions. [2019-12-07 14:36:45,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-07 14:36:45,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-07 14:36:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:45,464 INFO L225 Difference]: With dead ends: 36329 [2019-12-07 14:36:45,464 INFO L226 Difference]: Without dead ends: 34675 [2019-12-07 14:36:45,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=472, Invalid=2180, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 14:36:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34675 states. [2019-12-07 14:36:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34675 to 18528. [2019-12-07 14:36:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18528 states. [2019-12-07 14:36:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18528 states to 18528 states and 58055 transitions. [2019-12-07 14:36:45,865 INFO L78 Accepts]: Start accepts. Automaton has 18528 states and 58055 transitions. Word has length 55 [2019-12-07 14:36:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:45,865 INFO L462 AbstractCegarLoop]: Abstraction has 18528 states and 58055 transitions. [2019-12-07 14:36:45,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:36:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 18528 states and 58055 transitions. [2019-12-07 14:36:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:36:45,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:45,880 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, 1, 1] [2019-12-07 14:36:45,880 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:45,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 3 times [2019-12-07 14:36:45,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:45,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860878295] [2019-12-07 14:36:45,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:46,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860878295] [2019-12-07 14:36:46,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:46,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:36:46,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910585762] [2019-12-07 14:36:46,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:36:46,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:36:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:36:46,068 INFO L87 Difference]: Start difference. First operand 18528 states and 58055 transitions. Second operand 12 states. [2019-12-07 14:36:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:46,753 INFO L93 Difference]: Finished difference Result 34590 states and 107121 transitions. [2019-12-07 14:36:46,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 14:36:46,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-07 14:36:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:46,779 INFO L225 Difference]: With dead ends: 34590 [2019-12-07 14:36:46,779 INFO L226 Difference]: Without dead ends: 23945 [2019-12-07 14:36:46,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 14:36:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23945 states. [2019-12-07 14:36:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23945 to 16972. [2019-12-07 14:36:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16972 states. [2019-12-07 14:36:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16972 states to 16972 states and 52257 transitions. [2019-12-07 14:36:47,085 INFO L78 Accepts]: Start accepts. Automaton has 16972 states and 52257 transitions. Word has length 55 [2019-12-07 14:36:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:47,085 INFO L462 AbstractCegarLoop]: Abstraction has 16972 states and 52257 transitions. [2019-12-07 14:36:47,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:36:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 16972 states and 52257 transitions. [2019-12-07 14:36:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:36:47,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:47,098 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, 1, 1] [2019-12-07 14:36:47,098 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:47,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 4 times [2019-12-07 14:36:47,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:47,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248774720] [2019-12-07 14:36:47,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:47,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248774720] [2019-12-07 14:36:47,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:47,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 14:36:47,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397511502] [2019-12-07 14:36:47,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:36:47,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:36:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:36:47,238 INFO L87 Difference]: Start difference. First operand 16972 states and 52257 transitions. Second operand 13 states. [2019-12-07 14:36:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:48,182 INFO L93 Difference]: Finished difference Result 25641 states and 77613 transitions. [2019-12-07 14:36:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 14:36:48,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-07 14:36:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:48,205 INFO L225 Difference]: With dead ends: 25641 [2019-12-07 14:36:48,205 INFO L226 Difference]: Without dead ends: 21841 [2019-12-07 14:36:48,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=334, Invalid=1472, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 14:36:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21841 states. [2019-12-07 14:36:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21841 to 14035. [2019-12-07 14:36:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14035 states. [2019-12-07 14:36:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14035 states to 14035 states and 43127 transitions. [2019-12-07 14:36:48,451 INFO L78 Accepts]: Start accepts. Automaton has 14035 states and 43127 transitions. Word has length 55 [2019-12-07 14:36:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:48,451 INFO L462 AbstractCegarLoop]: Abstraction has 14035 states and 43127 transitions. [2019-12-07 14:36:48,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:36:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 14035 states and 43127 transitions. [2019-12-07 14:36:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:36:48,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:48,463 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, 1, 1] [2019-12-07 14:36:48,463 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:48,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 5 times [2019-12-07 14:36:48,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:48,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43777695] [2019-12-07 14:36:48,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:36:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:36:48,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:36:48,540 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:36:48,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24| 1)) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2351~0.base_24|) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24|) |v_ULTIMATE.start_main_~#t2351~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24|)) (= 0 |v_ULTIMATE.start_main_~#t2351~0.offset_18|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_26|, ULTIMATE.start_main_~#t2351~0.offset=|v_ULTIMATE.start_main_~#t2351~0.offset_18|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ULTIMATE.start_main_~#t2351~0.base=|v_ULTIMATE.start_main_~#t2351~0.base_24|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2352~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2353~0.base, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2353~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2352~0.base, ULTIMATE.start_main_~#t2351~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2351~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:36:48,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2352~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13| 1)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2352~0.base_13|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13|) |v_ULTIMATE.start_main_~#t2352~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2352~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2352~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2352~0.base] because there is no mapped edge [2019-12-07 14:36:48,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t2353~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13|) |v_ULTIMATE.start_main_~#t2353~0.offset_11| 2)) |v_#memory_int_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2353~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2353~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2353~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2353~0.base] because there is no mapped edge [2019-12-07 14:36:48,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff1_used~0_Out-1401843794 ~x$w_buff0_used~0_In-1401843794) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1401843794| (ite (not (and (not (= 0 (mod ~x$w_buff1_used~0_Out-1401843794 256))) (not (= 0 (mod ~x$w_buff0_used~0_Out-1401843794 256))))) 1 0)) (= 1 ~x$w_buff0_used~0_Out-1401843794) (= 1 ~x$w_buff0~0_Out-1401843794) (= P1Thread1of1ForFork0_~arg.offset_Out-1401843794 |P1Thread1of1ForFork0_#in~arg.offset_In-1401843794|) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1401843794| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1401843794) (= ~x$w_buff0~0_In-1401843794 ~x$w_buff1~0_Out-1401843794) (= |P1Thread1of1ForFork0_#in~arg.base_In-1401843794| P1Thread1of1ForFork0_~arg.base_Out-1401843794) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1401843794 0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1401843794, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1401843794|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1401843794|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1401843794} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1401843794, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1401843794, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1401843794, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1401843794, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1401843794|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1401843794|, ~x$w_buff1~0=~x$w_buff1~0_Out-1401843794, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1401843794|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1401843794, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1401843794} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 14:36:48,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-738696055 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-738696055 256) 0))) (or (and (= ~x$w_buff1~0_In-738696055 |P2Thread1of1ForFork1_#t~ite32_Out-738696055|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-738696055 |P2Thread1of1ForFork1_#t~ite32_Out-738696055|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-738696055, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-738696055, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-738696055, ~x~0=~x~0_In-738696055} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-738696055|, ~x$w_buff1~0=~x$w_buff1~0_In-738696055, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-738696055, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-738696055, ~x~0=~x~0_In-738696055} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:36:48,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 14:36:48,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In528227422 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In528227422 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out528227422|)) (and (= ~x$w_buff0_used~0_In528227422 |P2Thread1of1ForFork1_#t~ite34_Out528227422|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In528227422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In528227422} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out528227422|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In528227422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In528227422} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:36:48,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-331684563 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-331684563 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-331684563| ~x$w_buff0_used~0_In-331684563)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-331684563| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-331684563, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-331684563} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-331684563, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-331684563|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-331684563} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:36:48,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-226801791 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-226801791 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-226801791 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-226801791 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-226801791|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-226801791| ~x$w_buff1_used~0_In-226801791) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-226801791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-226801791, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226801791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226801791} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-226801791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-226801791, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226801791, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-226801791|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226801791} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:36:48,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-1820401614 ~x$r_buff0_thd2~0_Out-1820401614)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1820401614 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1820401614 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1820401614)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1820401614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820401614} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1820401614|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1820401614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820401614} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:36:48,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2144463238 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-2144463238 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2144463238 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2144463238 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-2144463238| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out-2144463238| ~x$r_buff1_thd2~0_In-2144463238) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2144463238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2144463238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2144463238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144463238} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-2144463238|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2144463238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2144463238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2144463238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144463238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:36:48,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:36:48,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-163914762 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out-163914762| |P0Thread1of1ForFork2_#t~ite12_Out-163914762|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-163914762 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-163914762 256) 0) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In-163914762 256) 0)) (= (mod ~x$w_buff0_used~0_In-163914762 256) 0))) (= ~x$w_buff1~0_In-163914762 |P0Thread1of1ForFork2_#t~ite11_Out-163914762|)) (and (= |P0Thread1of1ForFork2_#t~ite11_In-163914762| |P0Thread1of1ForFork2_#t~ite11_Out-163914762|) (not .cse0) (= ~x$w_buff1~0_In-163914762 |P0Thread1of1ForFork2_#t~ite12_Out-163914762|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-163914762, ~x$w_buff1~0=~x$w_buff1~0_In-163914762, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163914762, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-163914762, ~weak$$choice2~0=~weak$$choice2~0_In-163914762, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-163914762|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163914762} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-163914762, ~x$w_buff1~0=~x$w_buff1~0_In-163914762, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163914762, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-163914762, ~weak$$choice2~0=~weak$$choice2~0_In-163914762, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-163914762|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-163914762|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163914762} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 14:36:48,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In111486843 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In111486843 256) 0))) (or (= (mod ~x$w_buff0_used~0_In111486843 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In111486843 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In111486843 256)) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite14_Out111486843| ~x$w_buff0_used~0_In111486843) (= |P0Thread1of1ForFork2_#t~ite15_Out111486843| |P0Thread1of1ForFork2_#t~ite14_Out111486843|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In111486843| |P0Thread1of1ForFork2_#t~ite14_Out111486843|) (= |P0Thread1of1ForFork2_#t~ite15_Out111486843| ~x$w_buff0_used~0_In111486843)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In111486843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In111486843, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In111486843, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In111486843|, ~weak$$choice2~0=~weak$$choice2~0_In111486843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In111486843} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In111486843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In111486843, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out111486843|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In111486843, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out111486843|, ~weak$$choice2~0=~weak$$choice2~0_In111486843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In111486843} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 14:36:48,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In815910660 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In815910660| |P0Thread1of1ForFork2_#t~ite17_Out815910660|) (= ~x$w_buff1_used~0_In815910660 |P0Thread1of1ForFork2_#t~ite18_Out815910660|)) (and .cse0 (= ~x$w_buff1_used~0_In815910660 |P0Thread1of1ForFork2_#t~ite17_Out815910660|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In815910660 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In815910660 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In815910660 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In815910660 256) 0))) (= |P0Thread1of1ForFork2_#t~ite18_Out815910660| |P0Thread1of1ForFork2_#t~ite17_Out815910660|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In815910660, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In815910660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In815910660, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In815910660, ~weak$$choice2~0=~weak$$choice2~0_In815910660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815910660} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In815910660, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out815910660|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out815910660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In815910660, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In815910660, ~weak$$choice2~0=~weak$$choice2~0_In815910660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815910660} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:36:48,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 14:36:48,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:36:48,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-519157429 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-519157429 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-519157429 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-519157429 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-519157429| ~x$w_buff1_used~0_In-519157429)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-519157429| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-519157429, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-519157429, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-519157429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519157429} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-519157429|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519157429, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-519157429, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-519157429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519157429} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:36:48,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In195134002 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In195134002 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In195134002 |P2Thread1of1ForFork1_#t~ite36_Out195134002|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out195134002|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In195134002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195134002} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out195134002|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In195134002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195134002} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:36:48,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1704810579 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1704810579 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1704810579 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1704810579 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1704810579| ~x$r_buff1_thd3~0_In1704810579) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1704810579| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1704810579, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1704810579, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1704810579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704810579} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1704810579|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704810579, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1704810579, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1704810579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704810579} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:36:48,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:36:48,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:36:48,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1660626224 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1660626224 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1660626224| ~x~0_In-1660626224) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1660626224 |ULTIMATE.start_main_#t~ite41_Out-1660626224|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1660626224, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1660626224, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1660626224, ~x~0=~x~0_In-1660626224} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1660626224|, ~x$w_buff1~0=~x$w_buff1~0_In-1660626224, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1660626224, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1660626224, ~x~0=~x~0_In-1660626224} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:36:48,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 14:36:48,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-851888520 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-851888520 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-851888520| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-851888520| ~x$w_buff0_used~0_In-851888520)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-851888520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-851888520} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-851888520, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-851888520|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-851888520} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:36:48,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-675632542 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-675632542 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-675632542 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-675632542 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-675632542 |ULTIMATE.start_main_#t~ite44_Out-675632542|)) (and (= |ULTIMATE.start_main_#t~ite44_Out-675632542| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-675632542, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-675632542, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-675632542, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-675632542} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-675632542, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-675632542, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-675632542, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-675632542|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-675632542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:36:48,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-850412493 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-850412493 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-850412493| ~x$r_buff0_thd0~0_In-850412493) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-850412493|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-850412493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850412493} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-850412493, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-850412493|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850412493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:36:48,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In360435610 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In360435610 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In360435610 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In360435610 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out360435610| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In360435610 |ULTIMATE.start_main_#t~ite46_Out360435610|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In360435610, ~x$w_buff1_used~0=~x$w_buff1_used~0_In360435610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In360435610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360435610} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In360435610, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out360435610|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In360435610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In360435610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360435610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:36:48,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:36:48,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:36:48 BasicIcfg [2019-12-07 14:36:48,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:36:48,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:36:48,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:36:48,613 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:36:48,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:35:25" (3/4) ... [2019-12-07 14:36:48,615 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:36:48,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24| 1)) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2351~0.base_24|) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2351~0.base_24|) |v_ULTIMATE.start_main_~#t2351~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2351~0.base_24| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_24|)) (= 0 |v_ULTIMATE.start_main_~#t2351~0.offset_18|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_26|, ULTIMATE.start_main_~#t2351~0.offset=|v_ULTIMATE.start_main_~#t2351~0.offset_18|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ULTIMATE.start_main_~#t2351~0.base=|v_ULTIMATE.start_main_~#t2351~0.base_24|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2352~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2353~0.base, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2353~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2352~0.base, ULTIMATE.start_main_~#t2351~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2351~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:36:48,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2352~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13| 1)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2352~0.base_13|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13|) |v_ULTIMATE.start_main_~#t2352~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2352~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2352~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2352~0.base] because there is no mapped edge [2019-12-07 14:36:48,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t2353~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13|) |v_ULTIMATE.start_main_~#t2353~0.offset_11| 2)) |v_#memory_int_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2353~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2353~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2353~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2353~0.base] because there is no mapped edge [2019-12-07 14:36:48,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff1_used~0_Out-1401843794 ~x$w_buff0_used~0_In-1401843794) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1401843794| (ite (not (and (not (= 0 (mod ~x$w_buff1_used~0_Out-1401843794 256))) (not (= 0 (mod ~x$w_buff0_used~0_Out-1401843794 256))))) 1 0)) (= 1 ~x$w_buff0_used~0_Out-1401843794) (= 1 ~x$w_buff0~0_Out-1401843794) (= P1Thread1of1ForFork0_~arg.offset_Out-1401843794 |P1Thread1of1ForFork0_#in~arg.offset_In-1401843794|) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1401843794| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1401843794) (= ~x$w_buff0~0_In-1401843794 ~x$w_buff1~0_Out-1401843794) (= |P1Thread1of1ForFork0_#in~arg.base_In-1401843794| P1Thread1of1ForFork0_~arg.base_Out-1401843794) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1401843794 0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1401843794, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1401843794|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1401843794|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1401843794} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1401843794, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1401843794, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1401843794, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1401843794, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1401843794|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1401843794|, ~x$w_buff1~0=~x$w_buff1~0_Out-1401843794, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1401843794|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1401843794, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1401843794} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 14:36:48,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-738696055 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-738696055 256) 0))) (or (and (= ~x$w_buff1~0_In-738696055 |P2Thread1of1ForFork1_#t~ite32_Out-738696055|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-738696055 |P2Thread1of1ForFork1_#t~ite32_Out-738696055|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-738696055, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-738696055, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-738696055, ~x~0=~x~0_In-738696055} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-738696055|, ~x$w_buff1~0=~x$w_buff1~0_In-738696055, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-738696055, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-738696055, ~x~0=~x~0_In-738696055} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:36:48,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 14:36:48,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In528227422 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In528227422 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out528227422|)) (and (= ~x$w_buff0_used~0_In528227422 |P2Thread1of1ForFork1_#t~ite34_Out528227422|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In528227422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In528227422} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out528227422|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In528227422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In528227422} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:36:48,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-331684563 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-331684563 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-331684563| ~x$w_buff0_used~0_In-331684563)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-331684563| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-331684563, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-331684563} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-331684563, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-331684563|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-331684563} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:36:48,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-226801791 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-226801791 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-226801791 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-226801791 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-226801791|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-226801791| ~x$w_buff1_used~0_In-226801791) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-226801791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-226801791, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226801791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226801791} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-226801791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-226801791, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226801791, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-226801791|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226801791} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:36:48,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-1820401614 ~x$r_buff0_thd2~0_Out-1820401614)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1820401614 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1820401614 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1820401614)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1820401614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820401614} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1820401614|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1820401614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1820401614} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:36:48,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2144463238 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-2144463238 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2144463238 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2144463238 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-2144463238| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out-2144463238| ~x$r_buff1_thd2~0_In-2144463238) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2144463238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2144463238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2144463238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144463238} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-2144463238|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2144463238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2144463238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2144463238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144463238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:36:48,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:36:48,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-163914762 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out-163914762| |P0Thread1of1ForFork2_#t~ite12_Out-163914762|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-163914762 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-163914762 256) 0) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In-163914762 256) 0)) (= (mod ~x$w_buff0_used~0_In-163914762 256) 0))) (= ~x$w_buff1~0_In-163914762 |P0Thread1of1ForFork2_#t~ite11_Out-163914762|)) (and (= |P0Thread1of1ForFork2_#t~ite11_In-163914762| |P0Thread1of1ForFork2_#t~ite11_Out-163914762|) (not .cse0) (= ~x$w_buff1~0_In-163914762 |P0Thread1of1ForFork2_#t~ite12_Out-163914762|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-163914762, ~x$w_buff1~0=~x$w_buff1~0_In-163914762, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163914762, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-163914762, ~weak$$choice2~0=~weak$$choice2~0_In-163914762, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-163914762|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163914762} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-163914762, ~x$w_buff1~0=~x$w_buff1~0_In-163914762, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-163914762, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-163914762, ~weak$$choice2~0=~weak$$choice2~0_In-163914762, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-163914762|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-163914762|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163914762} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 14:36:48,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In111486843 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In111486843 256) 0))) (or (= (mod ~x$w_buff0_used~0_In111486843 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In111486843 256) 0) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In111486843 256)) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite14_Out111486843| ~x$w_buff0_used~0_In111486843) (= |P0Thread1of1ForFork2_#t~ite15_Out111486843| |P0Thread1of1ForFork2_#t~ite14_Out111486843|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In111486843| |P0Thread1of1ForFork2_#t~ite14_Out111486843|) (= |P0Thread1of1ForFork2_#t~ite15_Out111486843| ~x$w_buff0_used~0_In111486843)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In111486843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In111486843, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In111486843, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In111486843|, ~weak$$choice2~0=~weak$$choice2~0_In111486843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In111486843} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In111486843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In111486843, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out111486843|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In111486843, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out111486843|, ~weak$$choice2~0=~weak$$choice2~0_In111486843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In111486843} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 14:36:48,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In815910660 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In815910660| |P0Thread1of1ForFork2_#t~ite17_Out815910660|) (= ~x$w_buff1_used~0_In815910660 |P0Thread1of1ForFork2_#t~ite18_Out815910660|)) (and .cse0 (= ~x$w_buff1_used~0_In815910660 |P0Thread1of1ForFork2_#t~ite17_Out815910660|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In815910660 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In815910660 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In815910660 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In815910660 256) 0))) (= |P0Thread1of1ForFork2_#t~ite18_Out815910660| |P0Thread1of1ForFork2_#t~ite17_Out815910660|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In815910660, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In815910660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In815910660, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In815910660, ~weak$$choice2~0=~weak$$choice2~0_In815910660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815910660} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In815910660, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out815910660|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out815910660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In815910660, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In815910660, ~weak$$choice2~0=~weak$$choice2~0_In815910660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815910660} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:36:48,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 14:36:48,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 14:36:48,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-519157429 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-519157429 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-519157429 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-519157429 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-519157429| ~x$w_buff1_used~0_In-519157429)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-519157429| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-519157429, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-519157429, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-519157429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519157429} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-519157429|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-519157429, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-519157429, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-519157429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519157429} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:36:48,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In195134002 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In195134002 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In195134002 |P2Thread1of1ForFork1_#t~ite36_Out195134002|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out195134002|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In195134002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195134002} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out195134002|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In195134002, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195134002} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:36:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1704810579 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1704810579 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1704810579 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1704810579 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1704810579| ~x$r_buff1_thd3~0_In1704810579) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1704810579| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1704810579, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1704810579, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1704810579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704810579} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1704810579|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704810579, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1704810579, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1704810579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704810579} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:36:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:36:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:36:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1660626224 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1660626224 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1660626224| ~x~0_In-1660626224) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1660626224 |ULTIMATE.start_main_#t~ite41_Out-1660626224|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1660626224, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1660626224, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1660626224, ~x~0=~x~0_In-1660626224} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1660626224|, ~x$w_buff1~0=~x$w_buff1~0_In-1660626224, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1660626224, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1660626224, ~x~0=~x~0_In-1660626224} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:36:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 14:36:48,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-851888520 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-851888520 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-851888520| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-851888520| ~x$w_buff0_used~0_In-851888520)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-851888520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-851888520} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-851888520, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-851888520|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-851888520} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:36:48,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-675632542 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-675632542 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-675632542 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-675632542 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-675632542 |ULTIMATE.start_main_#t~ite44_Out-675632542|)) (and (= |ULTIMATE.start_main_#t~ite44_Out-675632542| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-675632542, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-675632542, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-675632542, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-675632542} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-675632542, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-675632542, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-675632542, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-675632542|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-675632542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:36:48,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-850412493 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-850412493 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-850412493| ~x$r_buff0_thd0~0_In-850412493) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-850412493|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-850412493, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850412493} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-850412493, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-850412493|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-850412493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:36:48,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In360435610 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In360435610 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In360435610 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In360435610 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out360435610| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In360435610 |ULTIMATE.start_main_#t~ite46_Out360435610|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In360435610, ~x$w_buff1_used~0=~x$w_buff1_used~0_In360435610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In360435610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360435610} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In360435610, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out360435610|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In360435610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In360435610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360435610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:36:48,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:36:48,677 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bfbe32e3-dab1-4246-b5ca-6a1706d0950c/bin/uautomizer/witness.graphml [2019-12-07 14:36:48,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:36:48,678 INFO L168 Benchmark]: Toolchain (without parser) took 83768.55 ms. Allocated memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: 5.8 GB). Free memory was 942.4 MB in the beginning and 5.0 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 14:36:48,679 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:36:48,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:48,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:48,679 INFO L168 Benchmark]: Boogie Preprocessor took 25.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:36:48,680 INFO L168 Benchmark]: RCFGBuilder took 400.54 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:48,680 INFO L168 Benchmark]: TraceAbstraction took 82854.92 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 14:36:48,680 INFO L168 Benchmark]: Witness Printer took 64.38 ms. Allocated memory is still 6.8 GB. Free memory was 5.1 GB in the beginning and 5.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:48,682 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.64 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 400.54 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 82854.92 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 64.38 ms. Allocated memory is still 6.8 GB. Free memory was 5.1 GB in the beginning and 5.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2351, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] FCALL, FORK 0 pthread_create(&t2352, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L777] EXPR 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=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L824] FCALL, FORK 0 pthread_create(&t2353, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 82.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3649 SDtfs, 5764 SDslu, 12590 SDs, 0 SdLazy, 5715 SolverSat, 238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144665occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 213152 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 674 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 154176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...