./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_rmo.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_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/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 8ad00954355f5898ee4afcc5f088055d3a9022ca .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:17:03,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:17:03,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:17:03,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:17:03,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:17:03,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:17:03,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:17:03,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:17:03,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:17:03,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:17:03,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:17:03,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:17:03,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:17:03,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:17:03,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:17:03,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:17:03,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:17:03,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:17:03,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:17:03,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:17:03,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:17:03,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:17:03,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:17:03,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:17:03,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:17:03,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:17:03,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:17:03,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:17:03,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:17:03,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:17:03,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:17:03,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:17:03,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:17:03,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:17:03,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:17:03,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:17:03,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:17:03,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:17:03,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:17:03,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:17:03,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:17:03,862 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:17:03,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:17:03,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:17:03,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:17:03,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:17:03,873 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:17:03,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:17:03,873 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:17:03,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:17:03,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:17:03,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:17:03,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:17:03,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:17:03,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:17:03,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:17:03,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:17:03,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:17:03,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:17:03,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:17:03,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:17:03,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:17:03,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:17:03,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:17:03,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:17:03,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:17:03,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:17:03,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:17:03,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:17:03,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:17:03,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:17:03,876 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_81474665-fb41-4b86-a473-2835c2a2aef2/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 -> 8ad00954355f5898ee4afcc5f088055d3a9022ca [2019-12-07 14:17:03,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:17:03,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:17:03,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:17:03,987 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:17:03,987 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:17:03,987 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix002_rmo.oepc.i [2019-12-07 14:17:04,027 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/data/7b0b6d277/94036d2a220b4ae7affd2328ee7a694b/FLAGa3bf13da0 [2019-12-07 14:17:04,416 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:17:04,417 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/sv-benchmarks/c/pthread-wmm/mix002_rmo.oepc.i [2019-12-07 14:17:04,429 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/data/7b0b6d277/94036d2a220b4ae7affd2328ee7a694b/FLAGa3bf13da0 [2019-12-07 14:17:04,441 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/data/7b0b6d277/94036d2a220b4ae7affd2328ee7a694b [2019-12-07 14:17:04,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:17:04,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:17:04,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:17:04,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:17:04,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:17:04,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:17:04" (1/1) ... [2019-12-07 14:17:04,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04, skipping insertion in model container [2019-12-07 14:17:04,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:17:04" (1/1) ... [2019-12-07 14:17:04,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:17:04,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:17:04,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:17:04,742 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:17:04,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:17:04,831 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:17:04,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04 WrapperNode [2019-12-07 14:17:04,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:17:04,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:17:04,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:17:04,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:17:04,837 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:17:04" (1/1) ... [2019-12-07 14:17:04,851 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:17:04" (1/1) ... [2019-12-07 14:17:04,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:17:04,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:17:04,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:17:04,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:17:04,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04" (1/1) ... [2019-12-07 14:17:04,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04" (1/1) ... [2019-12-07 14:17:04,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04" (1/1) ... [2019-12-07 14:17:04,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04" (1/1) ... [2019-12-07 14:17:04,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04" (1/1) ... [2019-12-07 14:17:04,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04" (1/1) ... [2019-12-07 14:17:04,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04" (1/1) ... [2019-12-07 14:17:04,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:17:04,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:17:04,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:17:04,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:17:04,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/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:17:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:17:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:17:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:17:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:17:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:17:04,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:17:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:17:04,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:17:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:17:04,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:17:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:17:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:17:04,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:17:04,937 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:17:05,308 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:17:05,308 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:17:05,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:17:05 BoogieIcfgContainer [2019-12-07 14:17:05,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:17:05,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:17:05,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:17:05,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:17:05,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:17:04" (1/3) ... [2019-12-07 14:17:05,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f3909b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:17:05, skipping insertion in model container [2019-12-07 14:17:05,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:17:04" (2/3) ... [2019-12-07 14:17:05,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f3909b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:17:05, skipping insertion in model container [2019-12-07 14:17:05,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:17:05" (3/3) ... [2019-12-07 14:17:05,314 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_rmo.oepc.i [2019-12-07 14:17:05,320 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:17:05,320 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:17:05,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:17:05,326 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:17:05,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:17:05,385 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:17:05,397 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:17:05,397 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:17:05,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:17:05,397 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:17:05,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:17:05,398 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:17:05,398 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:17:05,398 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:17:05,409 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-07 14:17:05,410 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 14:17:05,478 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 14:17:05,478 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:17:05,490 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 14:17:05,506 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 14:17:05,546 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 14:17:05,546 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:17:05,552 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 14:17:05,567 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 14:17:05,568 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:17:08,540 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 14:17:08,722 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-07 14:17:08,722 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-07 14:17:08,725 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-07 14:17:23,751 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-07 14:17:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-07 14:17:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:17:23,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:17:23,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:17:23,756 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:17:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:17:23,760 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-07 14:17:23,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:17:23,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518308972] [2019-12-07 14:17:23,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:17:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:23,893 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:17:23,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518308972] [2019-12-07 14:17:23,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:17:23,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:17:23,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158088320] [2019-12-07 14:17:23,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:17:23,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:17:23,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:17:23,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:17:23,908 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-07 14:17:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:17:24,646 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-07 14:17:24,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:17:24,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:17:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:17:25,087 INFO L225 Difference]: With dead ends: 119349 [2019-12-07 14:17:25,087 INFO L226 Difference]: Without dead ends: 112420 [2019-12-07 14:17:25,088 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:17:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-07 14:17:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-07 14:17:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-07 14:17:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-07 14:17:32,754 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-07 14:17:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:17:32,755 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-07 14:17:32,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:17:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-07 14:17:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:17:32,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:17:32,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:17:32,758 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:17:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:17:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-07 14:17:32,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:17:32,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82218174] [2019-12-07 14:17:32,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:17:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:32,820 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:17:32,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82218174] [2019-12-07 14:17:32,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:17:32,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:17:32,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349754057] [2019-12-07 14:17:32,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:17:32,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:17:32,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:17:32,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:17:32,822 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-07 14:17:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:17:34,068 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-07 14:17:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:17:34,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:17:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:17:34,527 INFO L225 Difference]: With dead ends: 179210 [2019-12-07 14:17:34,528 INFO L226 Difference]: Without dead ends: 179161 [2019-12-07 14:17:34,528 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:17:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-07 14:17:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-07 14:17:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-07 14:17:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-07 14:17:45,239 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-07 14:17:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:17:45,239 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-07 14:17:45,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:17:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-07 14:17:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:17:45,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:17:45,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:17:45,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:17:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:17:45,244 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-07 14:17:45,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:17:45,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120701437] [2019-12-07 14:17:45,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:17:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:45,289 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:17:45,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120701437] [2019-12-07 14:17:45,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:17:45,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:17:45,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496196427] [2019-12-07 14:17:45,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:17:45,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:17:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:17:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:17:45,291 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 4 states. [2019-12-07 14:17:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:17:46,501 INFO L93 Difference]: Finished difference Result 228309 states and 925057 transitions. [2019-12-07 14:17:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:17:46,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:17:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:17:47,096 INFO L225 Difference]: With dead ends: 228309 [2019-12-07 14:17:47,096 INFO L226 Difference]: Without dead ends: 228253 [2019-12-07 14:17:47,096 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:17:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228253 states. [2019-12-07 14:17:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228253 to 192006. [2019-12-07 14:17:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192006 states. [2019-12-07 14:17:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192006 states to 192006 states and 791382 transitions. [2019-12-07 14:17:59,839 INFO L78 Accepts]: Start accepts. Automaton has 192006 states and 791382 transitions. Word has length 13 [2019-12-07 14:17:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:17:59,840 INFO L462 AbstractCegarLoop]: Abstraction has 192006 states and 791382 transitions. [2019-12-07 14:17:59,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:17:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 192006 states and 791382 transitions. [2019-12-07 14:17:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:17:59,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:17:59,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:17:59,848 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:17:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:17:59,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-07 14:17:59,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:17:59,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999504344] [2019-12-07 14:17:59,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:17:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:17:59,902 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:17:59,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999504344] [2019-12-07 14:17:59,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:17:59,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:17:59,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760283655] [2019-12-07 14:17:59,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:17:59,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:17:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:17:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:17:59,903 INFO L87 Difference]: Start difference. First operand 192006 states and 791382 transitions. Second operand 5 states. [2019-12-07 14:18:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:01,619 INFO L93 Difference]: Finished difference Result 261525 states and 1067824 transitions. [2019-12-07 14:18:01,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:18:01,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 14:18:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:02,297 INFO L225 Difference]: With dead ends: 261525 [2019-12-07 14:18:02,297 INFO L226 Difference]: Without dead ends: 261525 [2019-12-07 14:18:02,297 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:18:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261525 states. [2019-12-07 14:18:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261525 to 219155. [2019-12-07 14:18:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219155 states. [2019-12-07 14:18:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219155 states to 219155 states and 902019 transitions. [2019-12-07 14:18:16,230 INFO L78 Accepts]: Start accepts. Automaton has 219155 states and 902019 transitions. Word has length 16 [2019-12-07 14:18:16,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:16,230 INFO L462 AbstractCegarLoop]: Abstraction has 219155 states and 902019 transitions. [2019-12-07 14:18:16,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:18:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 219155 states and 902019 transitions. [2019-12-07 14:18:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:18:16,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:16,243 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:18:16,243 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1841081636, now seen corresponding path program 1 times [2019-12-07 14:18:16,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:16,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599432196] [2019-12-07 14:18:16,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:16,307 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:18:16,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599432196] [2019-12-07 14:18:16,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:16,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:18:16,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181803859] [2019-12-07 14:18:16,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:16,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:16,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:16,309 INFO L87 Difference]: Start difference. First operand 219155 states and 902019 transitions. Second operand 3 states. [2019-12-07 14:18:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:17,643 INFO L93 Difference]: Finished difference Result 206599 states and 841454 transitions. [2019-12-07 14:18:17,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:17,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:18:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:18,197 INFO L225 Difference]: With dead ends: 206599 [2019-12-07 14:18:18,197 INFO L226 Difference]: Without dead ends: 206599 [2019-12-07 14:18:18,197 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:18:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206599 states. [2019-12-07 14:18:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206599 to 203319. [2019-12-07 14:18:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203319 states. [2019-12-07 14:18:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203319 states to 203319 states and 829292 transitions. [2019-12-07 14:18:27,973 INFO L78 Accepts]: Start accepts. Automaton has 203319 states and 829292 transitions. Word has length 18 [2019-12-07 14:18:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:27,973 INFO L462 AbstractCegarLoop]: Abstraction has 203319 states and 829292 transitions. [2019-12-07 14:18:27,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:18:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 203319 states and 829292 transitions. [2019-12-07 14:18:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:18:27,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:27,984 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:18:27,984 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1116134768, now seen corresponding path program 1 times [2019-12-07 14:18:27,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:27,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361995129] [2019-12-07 14:18:27,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:28,063 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:18:28,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361995129] [2019-12-07 14:18:28,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:28,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:18:28,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408783712] [2019-12-07 14:18:28,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:28,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:28,065 INFO L87 Difference]: Start difference. First operand 203319 states and 829292 transitions. Second operand 3 states. [2019-12-07 14:18:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:29,007 INFO L93 Difference]: Finished difference Result 204859 states and 833103 transitions. [2019-12-07 14:18:29,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:29,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:18:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:29,557 INFO L225 Difference]: With dead ends: 204859 [2019-12-07 14:18:29,557 INFO L226 Difference]: Without dead ends: 204859 [2019-12-07 14:18:29,557 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:18:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204859 states. [2019-12-07 14:18:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204859 to 203316. [2019-12-07 14:18:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203316 states. [2019-12-07 14:18:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203316 states to 203316 states and 829280 transitions. [2019-12-07 14:18:41,013 INFO L78 Accepts]: Start accepts. Automaton has 203316 states and 829280 transitions. Word has length 18 [2019-12-07 14:18:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:41,013 INFO L462 AbstractCegarLoop]: Abstraction has 203316 states and 829280 transitions. [2019-12-07 14:18:41,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:18:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 203316 states and 829280 transitions. [2019-12-07 14:18:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:18:41,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:41,027 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:18:41,027 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1413490544, now seen corresponding path program 1 times [2019-12-07 14:18:41,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:41,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911359557] [2019-12-07 14:18:41,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:41,084 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:18:41,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911359557] [2019-12-07 14:18:41,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:41,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:18:41,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422964577] [2019-12-07 14:18:41,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:18:41,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:41,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:18:41,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:18:41,086 INFO L87 Difference]: Start difference. First operand 203316 states and 829280 transitions. Second operand 5 states. [2019-12-07 14:18:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:43,064 INFO L93 Difference]: Finished difference Result 280247 states and 1123671 transitions. [2019-12-07 14:18:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:18:43,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 14:18:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:43,771 INFO L225 Difference]: With dead ends: 280247 [2019-12-07 14:18:43,772 INFO L226 Difference]: Without dead ends: 280156 [2019-12-07 14:18:43,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:18:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280156 states. [2019-12-07 14:18:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280156 to 210054. [2019-12-07 14:18:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210054 states. [2019-12-07 14:18:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210054 states to 210054 states and 856708 transitions. [2019-12-07 14:18:55,403 INFO L78 Accepts]: Start accepts. Automaton has 210054 states and 856708 transitions. Word has length 19 [2019-12-07 14:18:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:55,403 INFO L462 AbstractCegarLoop]: Abstraction has 210054 states and 856708 transitions. [2019-12-07 14:18:55,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:18:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 210054 states and 856708 transitions. [2019-12-07 14:18:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:18:55,416 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:55,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:18:55,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:55,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1244342164, now seen corresponding path program 1 times [2019-12-07 14:18:55,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:55,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273346302] [2019-12-07 14:18:55,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:55,437 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:18:55,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273346302] [2019-12-07 14:18:55,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:55,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:18:55,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567210316] [2019-12-07 14:18:55,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:55,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:55,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:55,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:55,438 INFO L87 Difference]: Start difference. First operand 210054 states and 856708 transitions. Second operand 3 states. [2019-12-07 14:18:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:55,563 INFO L93 Difference]: Finished difference Result 42006 states and 134724 transitions. [2019-12-07 14:18:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:55,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 14:18:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:55,625 INFO L225 Difference]: With dead ends: 42006 [2019-12-07 14:18:55,625 INFO L226 Difference]: Without dead ends: 42006 [2019-12-07 14:18:55,625 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:18:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42006 states. [2019-12-07 14:18:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42006 to 42006. [2019-12-07 14:18:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42006 states. [2019-12-07 14:18:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42006 states to 42006 states and 134724 transitions. [2019-12-07 14:18:56,328 INFO L78 Accepts]: Start accepts. Automaton has 42006 states and 134724 transitions. Word has length 19 [2019-12-07 14:18:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:56,328 INFO L462 AbstractCegarLoop]: Abstraction has 42006 states and 134724 transitions. [2019-12-07 14:18:56,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:18:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 42006 states and 134724 transitions. [2019-12-07 14:18:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:18:56,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:56,333 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:18:56,333 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:56,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-07 14:18:56,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:56,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782483535] [2019-12-07 14:18:56,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:56,373 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:18:56,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782483535] [2019-12-07 14:18:56,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:56,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:18:56,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097714533] [2019-12-07 14:18:56,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:18:56,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:18:56,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:18:56,375 INFO L87 Difference]: Start difference. First operand 42006 states and 134724 transitions. Second operand 6 states. [2019-12-07 14:18:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:56,923 INFO L93 Difference]: Finished difference Result 64397 states and 202368 transitions. [2019-12-07 14:18:56,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:18:56,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 14:18:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:57,015 INFO L225 Difference]: With dead ends: 64397 [2019-12-07 14:18:57,015 INFO L226 Difference]: Without dead ends: 64390 [2019-12-07 14:18:57,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 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:18:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64390 states. [2019-12-07 14:18:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64390 to 45327. [2019-12-07 14:18:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45327 states. [2019-12-07 14:18:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45327 states to 45327 states and 144470 transitions. [2019-12-07 14:18:58,762 INFO L78 Accepts]: Start accepts. Automaton has 45327 states and 144470 transitions. Word has length 22 [2019-12-07 14:18:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:18:58,762 INFO L462 AbstractCegarLoop]: Abstraction has 45327 states and 144470 transitions. [2019-12-07 14:18:58,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:18:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 45327 states and 144470 transitions. [2019-12-07 14:18:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:18:58,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:18:58,775 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:18:58,775 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:18:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:18:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-07 14:18:58,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:18:58,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124574047] [2019-12-07 14:18:58,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:18:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:18:58,796 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:18:58,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124574047] [2019-12-07 14:18:58,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:18:58,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:18:58,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703382653] [2019-12-07 14:18:58,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:18:58,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:18:58,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:18:58,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:58,797 INFO L87 Difference]: Start difference. First operand 45327 states and 144470 transitions. Second operand 3 states. [2019-12-07 14:18:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:18:58,988 INFO L93 Difference]: Finished difference Result 64967 states and 204237 transitions. [2019-12-07 14:18:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:18:58,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 14:18:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:18:59,083 INFO L225 Difference]: With dead ends: 64967 [2019-12-07 14:18:59,084 INFO L226 Difference]: Without dead ends: 64967 [2019-12-07 14:18:59,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:18:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64967 states. [2019-12-07 14:18:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64967 to 50523. [2019-12-07 14:18:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50523 states. [2019-12-07 14:19:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50523 states to 50523 states and 159451 transitions. [2019-12-07 14:19:00,075 INFO L78 Accepts]: Start accepts. Automaton has 50523 states and 159451 transitions. Word has length 27 [2019-12-07 14:19:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:00,075 INFO L462 AbstractCegarLoop]: Abstraction has 50523 states and 159451 transitions. [2019-12-07 14:19:00,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:19:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 50523 states and 159451 transitions. [2019-12-07 14:19:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:19:00,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:00,091 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:19:00,091 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-07 14:19:00,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:00,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481066785] [2019-12-07 14:19:00,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:00,140 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:19:00,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481066785] [2019-12-07 14:19:00,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:00,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:19:00,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828885648] [2019-12-07 14:19:00,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:19:00,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:00,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:19:00,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:19:00,141 INFO L87 Difference]: Start difference. First operand 50523 states and 159451 transitions. Second operand 6 states. [2019-12-07 14:19:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:00,631 INFO L93 Difference]: Finished difference Result 71197 states and 220410 transitions. [2019-12-07 14:19:00,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:19:00,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 14:19:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:00,731 INFO L225 Difference]: With dead ends: 71197 [2019-12-07 14:19:00,731 INFO L226 Difference]: Without dead ends: 71155 [2019-12-07 14:19:00,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:19:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71155 states. [2019-12-07 14:19:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71155 to 52480. [2019-12-07 14:19:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52480 states. [2019-12-07 14:19:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52480 states to 52480 states and 165372 transitions. [2019-12-07 14:19:01,830 INFO L78 Accepts]: Start accepts. Automaton has 52480 states and 165372 transitions. Word has length 27 [2019-12-07 14:19:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:01,831 INFO L462 AbstractCegarLoop]: Abstraction has 52480 states and 165372 transitions. [2019-12-07 14:19:01,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:19:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 52480 states and 165372 transitions. [2019-12-07 14:19:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:19:01,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:01,851 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] [2019-12-07 14:19:01,851 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1195565268, now seen corresponding path program 1 times [2019-12-07 14:19:01,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:01,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241340660] [2019-12-07 14:19:01,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:01,880 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:19:01,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241340660] [2019-12-07 14:19:01,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:01,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:19:01,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460274031] [2019-12-07 14:19:01,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:19:01,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:01,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:19:01,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:19:01,882 INFO L87 Difference]: Start difference. First operand 52480 states and 165372 transitions. Second operand 4 states. [2019-12-07 14:19:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:01,942 INFO L93 Difference]: Finished difference Result 20300 states and 61144 transitions. [2019-12-07 14:19:01,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:19:01,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 14:19:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:01,963 INFO L225 Difference]: With dead ends: 20300 [2019-12-07 14:19:01,964 INFO L226 Difference]: Without dead ends: 20300 [2019-12-07 14:19:01,964 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:19:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20300 states. [2019-12-07 14:19:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20300 to 18893. [2019-12-07 14:19:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18893 states. [2019-12-07 14:19:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18893 states to 18893 states and 56921 transitions. [2019-12-07 14:19:02,235 INFO L78 Accepts]: Start accepts. Automaton has 18893 states and 56921 transitions. Word has length 29 [2019-12-07 14:19:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:02,235 INFO L462 AbstractCegarLoop]: Abstraction has 18893 states and 56921 transitions. [2019-12-07 14:19:02,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:19:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 18893 states and 56921 transitions. [2019-12-07 14:19:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:19:02,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:02,249 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] [2019-12-07 14:19:02,249 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-07 14:19:02,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:02,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982423265] [2019-12-07 14:19:02,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:02,313 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:19:02,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982423265] [2019-12-07 14:19:02,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:02,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:19:02,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518662334] [2019-12-07 14:19:02,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:19:02,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:19:02,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:19:02,314 INFO L87 Difference]: Start difference. First operand 18893 states and 56921 transitions. Second operand 7 states. [2019-12-07 14:19:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:03,016 INFO L93 Difference]: Finished difference Result 26152 states and 76784 transitions. [2019-12-07 14:19:03,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 14:19:03,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 14:19:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:03,045 INFO L225 Difference]: With dead ends: 26152 [2019-12-07 14:19:03,045 INFO L226 Difference]: Without dead ends: 26152 [2019-12-07 14:19:03,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:19:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26152 states. [2019-12-07 14:19:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26152 to 18344. [2019-12-07 14:19:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18344 states. [2019-12-07 14:19:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18344 states to 18344 states and 55324 transitions. [2019-12-07 14:19:03,361 INFO L78 Accepts]: Start accepts. Automaton has 18344 states and 55324 transitions. Word has length 33 [2019-12-07 14:19:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:03,361 INFO L462 AbstractCegarLoop]: Abstraction has 18344 states and 55324 transitions. [2019-12-07 14:19:03,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:19:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 18344 states and 55324 transitions. [2019-12-07 14:19:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:19:03,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:03,376 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] [2019-12-07 14:19:03,376 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:03,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1576704066, now seen corresponding path program 1 times [2019-12-07 14:19:03,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:03,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312314078] [2019-12-07 14:19:03,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:03,416 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:19:03,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312314078] [2019-12-07 14:19:03,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:03,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:19:03,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589871478] [2019-12-07 14:19:03,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:19:03,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:03,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:19:03,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:19:03,418 INFO L87 Difference]: Start difference. First operand 18344 states and 55324 transitions. Second operand 5 states. [2019-12-07 14:19:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:03,479 INFO L93 Difference]: Finished difference Result 16845 states and 52030 transitions. [2019-12-07 14:19:03,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:19:03,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 14:19:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:03,498 INFO L225 Difference]: With dead ends: 16845 [2019-12-07 14:19:03,498 INFO L226 Difference]: Without dead ends: 16845 [2019-12-07 14:19:03,498 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:19:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16845 states. [2019-12-07 14:19:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16845 to 15143. [2019-12-07 14:19:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-07 14:19:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-07 14:19:03,783 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 40 [2019-12-07 14:19:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:03,783 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-07 14:19:03,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:19:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-07 14:19:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 14:19:03,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:03,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:03,797 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-07 14:19:03,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:03,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068306504] [2019-12-07 14:19:03,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:03,832 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:19:03,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068306504] [2019-12-07 14:19:03,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:03,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:19:03,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988754173] [2019-12-07 14:19:03,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:19:03,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:03,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:19:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:03,833 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-07 14:19:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:03,902 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-07 14:19:03,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:19:03,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 14:19:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:03,922 INFO L225 Difference]: With dead ends: 19655 [2019-12-07 14:19:03,923 INFO L226 Difference]: Without dead ends: 19655 [2019-12-07 14:19:03,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-07 14:19:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-07 14:19:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-07 14:19:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-07 14:19:04,176 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-07 14:19:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:04,176 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-07 14:19:04,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:19:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-07 14:19:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 14:19:04,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:04,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:04,191 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-07 14:19:04,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:04,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86172243] [2019-12-07 14:19:04,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:04,232 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:19:04,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86172243] [2019-12-07 14:19:04,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:04,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:19:04,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340742301] [2019-12-07 14:19:04,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:19:04,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:04,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:19:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:04,233 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 3 states. [2019-12-07 14:19:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:04,314 INFO L93 Difference]: Finished difference Result 18028 states and 55353 transitions. [2019-12-07 14:19:04,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:19:04,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 14:19:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:04,332 INFO L225 Difference]: With dead ends: 18028 [2019-12-07 14:19:04,333 INFO L226 Difference]: Without dead ends: 18028 [2019-12-07 14:19:04,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:19:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18028 states. [2019-12-07 14:19:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 14395. [2019-12-07 14:19:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14395 states. [2019-12-07 14:19:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14395 states to 14395 states and 44555 transitions. [2019-12-07 14:19:04,561 INFO L78 Accepts]: Start accepts. Automaton has 14395 states and 44555 transitions. Word has length 65 [2019-12-07 14:19:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:04,562 INFO L462 AbstractCegarLoop]: Abstraction has 14395 states and 44555 transitions. [2019-12-07 14:19:04,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:19:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 14395 states and 44555 transitions. [2019-12-07 14:19:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:19:04,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:04,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:04,575 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:04,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:04,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1193255729, now seen corresponding path program 1 times [2019-12-07 14:19:04,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:04,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471952026] [2019-12-07 14:19:04,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:04,622 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:19:04,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471952026] [2019-12-07 14:19:04,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:04,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:19:04,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328138098] [2019-12-07 14:19:04,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:19:04,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:04,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:19:04,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:19:04,623 INFO L87 Difference]: Start difference. First operand 14395 states and 44555 transitions. Second operand 4 states. [2019-12-07 14:19:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:04,705 INFO L93 Difference]: Finished difference Result 14210 states and 43819 transitions. [2019-12-07 14:19:04,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:19:04,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 14:19:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:04,721 INFO L225 Difference]: With dead ends: 14210 [2019-12-07 14:19:04,721 INFO L226 Difference]: Without dead ends: 14210 [2019-12-07 14:19:04,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:19:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-07 14:19:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 12796. [2019-12-07 14:19:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12796 states. [2019-12-07 14:19:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12796 states to 12796 states and 39396 transitions. [2019-12-07 14:19:04,921 INFO L78 Accepts]: Start accepts. Automaton has 12796 states and 39396 transitions. Word has length 66 [2019-12-07 14:19:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:04,921 INFO L462 AbstractCegarLoop]: Abstraction has 12796 states and 39396 transitions. [2019-12-07 14:19:04,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:19:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 12796 states and 39396 transitions. [2019-12-07 14:19:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:19:04,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:04,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:04,932 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -612810128, now seen corresponding path program 1 times [2019-12-07 14:19:04,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:04,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625673589] [2019-12-07 14:19:04,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:05,569 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:19:05,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625673589] [2019-12-07 14:19:05,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:05,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 14:19:05,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138954123] [2019-12-07 14:19:05,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 14:19:05,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 14:19:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:19:05,570 INFO L87 Difference]: Start difference. First operand 12796 states and 39396 transitions. Second operand 19 states. [2019-12-07 14:19:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:13,557 INFO L93 Difference]: Finished difference Result 42125 states and 127089 transitions. [2019-12-07 14:19:13,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-07 14:19:13,557 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-07 14:19:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:13,596 INFO L225 Difference]: With dead ends: 42125 [2019-12-07 14:19:13,596 INFO L226 Difference]: Without dead ends: 33911 [2019-12-07 14:19:13,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=686, Invalid=4006, Unknown=0, NotChecked=0, Total=4692 [2019-12-07 14:19:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33911 states. [2019-12-07 14:19:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33911 to 16208. [2019-12-07 14:19:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16208 states. [2019-12-07 14:19:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16208 states to 16208 states and 50230 transitions. [2019-12-07 14:19:13,984 INFO L78 Accepts]: Start accepts. Automaton has 16208 states and 50230 transitions. Word has length 66 [2019-12-07 14:19:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:13,984 INFO L462 AbstractCegarLoop]: Abstraction has 16208 states and 50230 transitions. [2019-12-07 14:19:13,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 14:19:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 16208 states and 50230 transitions. [2019-12-07 14:19:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:19:13,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:14,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:14,000 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:14,000 INFO L82 PathProgramCache]: Analyzing trace with hash -44245440, now seen corresponding path program 2 times [2019-12-07 14:19:14,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:14,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170039773] [2019-12-07 14:19:14,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:14,232 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:19:14,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170039773] [2019-12-07 14:19:14,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:14,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 14:19:14,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773014327] [2019-12-07 14:19:14,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:19:14,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:14,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:19:14,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:19:14,233 INFO L87 Difference]: Start difference. First operand 16208 states and 50230 transitions. Second operand 13 states. [2019-12-07 14:19:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:14,936 INFO L93 Difference]: Finished difference Result 23566 states and 71591 transitions. [2019-12-07 14:19:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 14:19:14,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-07 14:19:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:14,956 INFO L225 Difference]: With dead ends: 23566 [2019-12-07 14:19:14,956 INFO L226 Difference]: Without dead ends: 20866 [2019-12-07 14:19:14,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-12-07 14:19:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20866 states. [2019-12-07 14:19:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20866 to 17325. [2019-12-07 14:19:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17325 states. [2019-12-07 14:19:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17325 states to 17325 states and 53229 transitions. [2019-12-07 14:19:15,222 INFO L78 Accepts]: Start accepts. Automaton has 17325 states and 53229 transitions. Word has length 66 [2019-12-07 14:19:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:15,222 INFO L462 AbstractCegarLoop]: Abstraction has 17325 states and 53229 transitions. [2019-12-07 14:19:15,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:19:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 17325 states and 53229 transitions. [2019-12-07 14:19:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:19:15,237 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:15,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:15,237 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash -795332344, now seen corresponding path program 3 times [2019-12-07 14:19:15,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:15,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115623179] [2019-12-07 14:19:15,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:15,310 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:19:15,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115623179] [2019-12-07 14:19:15,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:15,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:19:15,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636362291] [2019-12-07 14:19:15,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:19:15,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:15,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:19:15,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:19:15,312 INFO L87 Difference]: Start difference. First operand 17325 states and 53229 transitions. Second operand 7 states. [2019-12-07 14:19:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:15,579 INFO L93 Difference]: Finished difference Result 42819 states and 129435 transitions. [2019-12-07 14:19:15,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:19:15,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 14:19:15,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:15,615 INFO L225 Difference]: With dead ends: 42819 [2019-12-07 14:19:15,615 INFO L226 Difference]: Without dead ends: 31883 [2019-12-07 14:19:15,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:19:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31883 states. [2019-12-07 14:19:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31883 to 17884. [2019-12-07 14:19:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17884 states. [2019-12-07 14:19:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17884 states to 17884 states and 55314 transitions. [2019-12-07 14:19:15,985 INFO L78 Accepts]: Start accepts. Automaton has 17884 states and 55314 transitions. Word has length 66 [2019-12-07 14:19:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:15,985 INFO L462 AbstractCegarLoop]: Abstraction has 17884 states and 55314 transitions. [2019-12-07 14:19:15,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:19:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 17884 states and 55314 transitions. [2019-12-07 14:19:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:19:16,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:16,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:16,001 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:16,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2118112598, now seen corresponding path program 4 times [2019-12-07 14:19:16,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:16,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170317138] [2019-12-07 14:19:16,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:16,089 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:19:16,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170317138] [2019-12-07 14:19:16,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:16,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:19:16,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521149966] [2019-12-07 14:19:16,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:19:16,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:16,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:19:16,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:19:16,091 INFO L87 Difference]: Start difference. First operand 17884 states and 55314 transitions. Second operand 7 states. [2019-12-07 14:19:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:16,434 INFO L93 Difference]: Finished difference Result 42796 states and 129019 transitions. [2019-12-07 14:19:16,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:19:16,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 14:19:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:16,473 INFO L225 Difference]: With dead ends: 42796 [2019-12-07 14:19:16,474 INFO L226 Difference]: Without dead ends: 32374 [2019-12-07 14:19:16,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:19:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32374 states. [2019-12-07 14:19:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32374 to 20089. [2019-12-07 14:19:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20089 states. [2019-12-07 14:19:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20089 states to 20089 states and 61484 transitions. [2019-12-07 14:19:16,869 INFO L78 Accepts]: Start accepts. Automaton has 20089 states and 61484 transitions. Word has length 66 [2019-12-07 14:19:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:16,870 INFO L462 AbstractCegarLoop]: Abstraction has 20089 states and 61484 transitions. [2019-12-07 14:19:16,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:19:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 20089 states and 61484 transitions. [2019-12-07 14:19:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:19:16,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:16,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:16,888 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:16,888 INFO L82 PathProgramCache]: Analyzing trace with hash 603284016, now seen corresponding path program 5 times [2019-12-07 14:19:16,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:16,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285106672] [2019-12-07 14:19:16,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:16,919 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:19:16,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285106672] [2019-12-07 14:19:16,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:16,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:19:16,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956543271] [2019-12-07 14:19:16,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:19:16,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:16,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:19:16,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:19:16,920 INFO L87 Difference]: Start difference. First operand 20089 states and 61484 transitions. Second operand 3 states. [2019-12-07 14:19:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:16,971 INFO L93 Difference]: Finished difference Result 16321 states and 49063 transitions. [2019-12-07 14:19:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:19:16,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 14:19:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:16,988 INFO L225 Difference]: With dead ends: 16321 [2019-12-07 14:19:16,988 INFO L226 Difference]: Without dead ends: 16321 [2019-12-07 14:19:16,988 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:19:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16321 states. [2019-12-07 14:19:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16321 to 14777. [2019-12-07 14:19:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14777 states. [2019-12-07 14:19:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14777 states to 14777 states and 44376 transitions. [2019-12-07 14:19:17,216 INFO L78 Accepts]: Start accepts. Automaton has 14777 states and 44376 transitions. Word has length 66 [2019-12-07 14:19:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:17,216 INFO L462 AbstractCegarLoop]: Abstraction has 14777 states and 44376 transitions. [2019-12-07 14:19:17,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:19:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 14777 states and 44376 transitions. [2019-12-07 14:19:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:19:17,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:17,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:17,229 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-07 14:19:17,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:17,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957486649] [2019-12-07 14:19:17,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:17,351 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:19:17,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957486649] [2019-12-07 14:19:17,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:17,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:19:17,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710037618] [2019-12-07 14:19:17,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:19:17,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:17,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:19:17,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:19:17,352 INFO L87 Difference]: Start difference. First operand 14777 states and 44376 transitions. Second operand 10 states. [2019-12-07 14:19:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:18,518 INFO L93 Difference]: Finished difference Result 27927 states and 83405 transitions. [2019-12-07 14:19:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 14:19:18,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 14:19:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:18,545 INFO L225 Difference]: With dead ends: 27927 [2019-12-07 14:19:18,545 INFO L226 Difference]: Without dead ends: 21083 [2019-12-07 14:19:18,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-12-07 14:19:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21083 states. [2019-12-07 14:19:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21083 to 15369. [2019-12-07 14:19:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15369 states. [2019-12-07 14:19:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 46010 transitions. [2019-12-07 14:19:18,808 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 46010 transitions. Word has length 67 [2019-12-07 14:19:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:18,808 INFO L462 AbstractCegarLoop]: Abstraction has 15369 states and 46010 transitions. [2019-12-07 14:19:18,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:19:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 46010 transitions. [2019-12-07 14:19:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:19:18,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:18,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:18,822 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:18,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:18,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1732898859, now seen corresponding path program 2 times [2019-12-07 14:19:18,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:18,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425534972] [2019-12-07 14:19:18,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:18,953 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:19:18,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425534972] [2019-12-07 14:19:18,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:18,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:19:18,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990139925] [2019-12-07 14:19:18,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:19:18,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:18,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:19:18,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:19:18,955 INFO L87 Difference]: Start difference. First operand 15369 states and 46010 transitions. Second operand 10 states. [2019-12-07 14:19:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:19,991 INFO L93 Difference]: Finished difference Result 25804 states and 76626 transitions. [2019-12-07 14:19:19,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 14:19:19,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 14:19:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:20,014 INFO L225 Difference]: With dead ends: 25804 [2019-12-07 14:19:20,014 INFO L226 Difference]: Without dead ends: 22415 [2019-12-07 14:19:20,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:19:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22415 states. [2019-12-07 14:19:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22415 to 15745. [2019-12-07 14:19:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15745 states. [2019-12-07 14:19:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15745 states to 15745 states and 46962 transitions. [2019-12-07 14:19:20,289 INFO L78 Accepts]: Start accepts. Automaton has 15745 states and 46962 transitions. Word has length 67 [2019-12-07 14:19:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:20,289 INFO L462 AbstractCegarLoop]: Abstraction has 15745 states and 46962 transitions. [2019-12-07 14:19:20,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:19:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 15745 states and 46962 transitions. [2019-12-07 14:19:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:19:20,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:20,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:20,303 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:20,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1111610073, now seen corresponding path program 3 times [2019-12-07 14:19:20,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:20,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090371834] [2019-12-07 14:19:20,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:20,412 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:19:20,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090371834] [2019-12-07 14:19:20,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:20,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:19:20,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140263854] [2019-12-07 14:19:20,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:19:20,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:20,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:19:20,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:19:20,413 INFO L87 Difference]: Start difference. First operand 15745 states and 46962 transitions. Second operand 11 states. [2019-12-07 14:19:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:21,291 INFO L93 Difference]: Finished difference Result 24722 states and 73343 transitions. [2019-12-07 14:19:21,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 14:19:21,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 14:19:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:21,312 INFO L225 Difference]: With dead ends: 24722 [2019-12-07 14:19:21,313 INFO L226 Difference]: Without dead ends: 21811 [2019-12-07 14:19:21,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:19:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21811 states. [2019-12-07 14:19:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21811 to 15361. [2019-12-07 14:19:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15361 states. [2019-12-07 14:19:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15361 states to 15361 states and 45846 transitions. [2019-12-07 14:19:21,579 INFO L78 Accepts]: Start accepts. Automaton has 15361 states and 45846 transitions. Word has length 67 [2019-12-07 14:19:21,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:21,579 INFO L462 AbstractCegarLoop]: Abstraction has 15361 states and 45846 transitions. [2019-12-07 14:19:21,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:19:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 15361 states and 45846 transitions. [2019-12-07 14:19:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:19:21,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:21,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:21,592 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:21,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 4 times [2019-12-07 14:19:21,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:21,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817617096] [2019-12-07 14:19:21,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:21,716 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:19:21,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817617096] [2019-12-07 14:19:21,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:21,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:19:21,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522705292] [2019-12-07 14:19:21,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:19:21,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:21,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:19:21,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:19:21,718 INFO L87 Difference]: Start difference. First operand 15361 states and 45846 transitions. Second operand 11 states. [2019-12-07 14:19:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:22,797 INFO L93 Difference]: Finished difference Result 23058 states and 68549 transitions. [2019-12-07 14:19:22,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:19:22,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 14:19:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:22,820 INFO L225 Difference]: With dead ends: 23058 [2019-12-07 14:19:22,820 INFO L226 Difference]: Without dead ends: 21503 [2019-12-07 14:19:22,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:19:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21503 states. [2019-12-07 14:19:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21503 to 15433. [2019-12-07 14:19:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15433 states. [2019-12-07 14:19:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15433 states to 15433 states and 46015 transitions. [2019-12-07 14:19:23,085 INFO L78 Accepts]: Start accepts. Automaton has 15433 states and 46015 transitions. Word has length 67 [2019-12-07 14:19:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:23,085 INFO L462 AbstractCegarLoop]: Abstraction has 15433 states and 46015 transitions. [2019-12-07 14:19:23,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:19:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 15433 states and 46015 transitions. [2019-12-07 14:19:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:19:23,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:23,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:23,099 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash -809344243, now seen corresponding path program 5 times [2019-12-07 14:19:23,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:23,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99158146] [2019-12-07 14:19:23,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:23,230 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:19:23,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99158146] [2019-12-07 14:19:23,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:23,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:19:23,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261877482] [2019-12-07 14:19:23,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:19:23,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:19:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:19:23,231 INFO L87 Difference]: Start difference. First operand 15433 states and 46015 transitions. Second operand 12 states. [2019-12-07 14:19:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:24,329 INFO L93 Difference]: Finished difference Result 22670 states and 67364 transitions. [2019-12-07 14:19:24,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:19:24,329 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 14:19:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:24,350 INFO L225 Difference]: With dead ends: 22670 [2019-12-07 14:19:24,350 INFO L226 Difference]: Without dead ends: 22011 [2019-12-07 14:19:24,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-07 14:19:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22011 states. [2019-12-07 14:19:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22011 to 15421. [2019-12-07 14:19:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15421 states. [2019-12-07 14:19:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15421 states to 15421 states and 45983 transitions. [2019-12-07 14:19:24,621 INFO L78 Accepts]: Start accepts. Automaton has 15421 states and 45983 transitions. Word has length 67 [2019-12-07 14:19:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:24,621 INFO L462 AbstractCegarLoop]: Abstraction has 15421 states and 45983 transitions. [2019-12-07 14:19:24,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:19:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 15421 states and 45983 transitions. [2019-12-07 14:19:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:19:24,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:24,634 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -96373001, now seen corresponding path program 6 times [2019-12-07 14:19:24,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:24,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259590802] [2019-12-07 14:19:24,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:24,742 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:19:24,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259590802] [2019-12-07 14:19:24,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:24,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:19:24,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774782544] [2019-12-07 14:19:24,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:19:24,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:24,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:19:24,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:19:24,743 INFO L87 Difference]: Start difference. First operand 15421 states and 45983 transitions. Second operand 11 states. [2019-12-07 14:19:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:25,444 INFO L93 Difference]: Finished difference Result 34490 states and 101906 transitions. [2019-12-07 14:19:25,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 14:19:25,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 14:19:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:25,477 INFO L225 Difference]: With dead ends: 34490 [2019-12-07 14:19:25,477 INFO L226 Difference]: Without dead ends: 29951 [2019-12-07 14:19:25,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 14:19:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29951 states. [2019-12-07 14:19:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29951 to 17345. [2019-12-07 14:19:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17345 states. [2019-12-07 14:19:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17345 states to 17345 states and 51550 transitions. [2019-12-07 14:19:25,821 INFO L78 Accepts]: Start accepts. Automaton has 17345 states and 51550 transitions. Word has length 67 [2019-12-07 14:19:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:25,822 INFO L462 AbstractCegarLoop]: Abstraction has 17345 states and 51550 transitions. [2019-12-07 14:19:25,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:19:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand 17345 states and 51550 transitions. [2019-12-07 14:19:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:19:25,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:25,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:25,837 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:25,837 INFO L82 PathProgramCache]: Analyzing trace with hash -187199721, now seen corresponding path program 7 times [2019-12-07 14:19:25,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:25,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394096570] [2019-12-07 14:19:25,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:25,949 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:19:25,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394096570] [2019-12-07 14:19:25,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:25,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:19:25,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559616803] [2019-12-07 14:19:25,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:19:25,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:25,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:19:25,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:19:25,950 INFO L87 Difference]: Start difference. First operand 17345 states and 51550 transitions. Second operand 12 states. [2019-12-07 14:19:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:29,757 INFO L93 Difference]: Finished difference Result 27966 states and 82041 transitions. [2019-12-07 14:19:29,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 14:19:29,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 14:19:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:29,786 INFO L225 Difference]: With dead ends: 27966 [2019-12-07 14:19:29,786 INFO L226 Difference]: Without dead ends: 25179 [2019-12-07 14:19:29,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2019-12-07 14:19:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25179 states. [2019-12-07 14:19:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25179 to 16712. [2019-12-07 14:19:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16712 states. [2019-12-07 14:19:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16712 states to 16712 states and 49504 transitions. [2019-12-07 14:19:30,093 INFO L78 Accepts]: Start accepts. Automaton has 16712 states and 49504 transitions. Word has length 67 [2019-12-07 14:19:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:30,093 INFO L462 AbstractCegarLoop]: Abstraction has 16712 states and 49504 transitions. [2019-12-07 14:19:30,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:19:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 16712 states and 49504 transitions. [2019-12-07 14:19:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:19:30,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:30,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:30,108 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 8 times [2019-12-07 14:19:30,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:30,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702738225] [2019-12-07 14:19:30,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:19:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:19:30,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702738225] [2019-12-07 14:19:30,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:19:30,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:19:30,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578553372] [2019-12-07 14:19:30,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:19:30,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:19:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:19:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:19:30,201 INFO L87 Difference]: Start difference. First operand 16712 states and 49504 transitions. Second operand 11 states. [2019-12-07 14:19:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:19:30,779 INFO L93 Difference]: Finished difference Result 29006 states and 85332 transitions. [2019-12-07 14:19:30,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 14:19:30,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 14:19:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:19:30,808 INFO L225 Difference]: With dead ends: 29006 [2019-12-07 14:19:30,808 INFO L226 Difference]: Without dead ends: 25218 [2019-12-07 14:19:30,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:19:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25218 states. [2019-12-07 14:19:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25218 to 14169. [2019-12-07 14:19:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14169 states. [2019-12-07 14:19:31,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14169 states to 14169 states and 42262 transitions. [2019-12-07 14:19:31,092 INFO L78 Accepts]: Start accepts. Automaton has 14169 states and 42262 transitions. Word has length 67 [2019-12-07 14:19:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:19:31,092 INFO L462 AbstractCegarLoop]: Abstraction has 14169 states and 42262 transitions. [2019-12-07 14:19:31,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:19:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14169 states and 42262 transitions. [2019-12-07 14:19:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:19:31,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:19:31,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:19:31,105 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:19:31,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:19:31,105 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 9 times [2019-12-07 14:19:31,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:19:31,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897811349] [2019-12-07 14:19:31,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:19:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:19:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:19:31,189 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:19:31,189 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:19:31,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23| 1) |v_#valid_62|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t50~0.base_23|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23|) |v_ULTIMATE.start_main_~#t50~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= (select .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23|) 0) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_ULTIMATE.start_main_~#t50~0.offset_18| 0) (= |v_#NULL.offset_4| 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t50~0.base_23| 4) |v_#length_23|) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_15|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_20|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t50~0.offset=|v_ULTIMATE.start_main_~#t50~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_18|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ULTIMATE.start_main_~#t50~0.base=|v_ULTIMATE.start_main_~#t50~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t52~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t50~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t51~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t51~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ULTIMATE.start_main_~#t50~0.base, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 14:19:31,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork2_#in~arg.offset_In260881881| P0Thread1of1ForFork2_~arg.offset_Out260881881) (= ~a$w_buff0~0_In260881881 ~a$w_buff1~0_Out260881881) (= ~a$w_buff0~0_Out260881881 1) (= ~a$w_buff0_used~0_In260881881 ~a$w_buff1_used~0_Out260881881) (= 1 ~a$w_buff0_used~0_Out260881881) (= |P0Thread1of1ForFork2_#in~arg.base_In260881881| P0Thread1of1ForFork2_~arg.base_Out260881881) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out260881881 0)) (= (ite (not (and (not (= 0 (mod ~a$w_buff0_used~0_Out260881881 256))) (not (= 0 (mod ~a$w_buff1_used~0_Out260881881 256))))) 1 0) |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out260881881|) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out260881881 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out260881881|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In260881881|, ~a$w_buff0~0=~a$w_buff0~0_In260881881, ~a$w_buff0_used~0=~a$w_buff0_used~0_In260881881, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In260881881|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out260881881, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In260881881|, ~a$w_buff0~0=~a$w_buff0~0_Out260881881, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out260881881, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out260881881, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out260881881, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In260881881|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out260881881, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out260881881, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out260881881|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:19:31,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t51~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t51~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13| 1) |v_#valid_36|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13|) |v_ULTIMATE.start_main_~#t51~0.offset_11| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t51~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t51~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_13|, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t51~0.base, ULTIMATE.start_main_~#t51~0.offset] because there is no mapped edge [2019-12-07 14:19:31,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd2~0_In-1736517195 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1736517195 256))) (.cse0 (= |P1Thread1of1ForFork0_#t~ite10_Out-1736517195| |P1Thread1of1ForFork0_#t~ite9_Out-1736517195|))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out-1736517195| ~a$w_buff1~0_In-1736517195) (not .cse2)) (and (or .cse2 .cse1) .cse0 (= |P1Thread1of1ForFork0_#t~ite9_Out-1736517195| ~a~0_In-1736517195)))) InVars {~a~0=~a~0_In-1736517195, ~a$w_buff1~0=~a$w_buff1~0_In-1736517195, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1736517195, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1736517195} OutVars{~a~0=~a~0_In-1736517195, ~a$w_buff1~0=~a$w_buff1~0_In-1736517195, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-1736517195|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1736517195, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1736517195|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1736517195} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 14:19:31,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1298073589 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1298073589 256)))) (or (and (= ~a$w_buff0_used~0_In-1298073589 |P1Thread1of1ForFork0_#t~ite11_Out-1298073589|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-1298073589|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1298073589, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1298073589} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1298073589, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1298073589|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1298073589} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 14:19:31,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In2126512762 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In2126512762 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In2126512762 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In2126512762 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In2126512762 |P1Thread1of1ForFork0_#t~ite12_Out2126512762|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out2126512762|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2126512762, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2126512762, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2126512762, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2126512762} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2126512762, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2126512762, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out2126512762|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2126512762, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2126512762} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 14:19:31,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1683294484 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1683294484 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite13_Out-1683294484| 0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-1683294484 |P1Thread1of1ForFork0_#t~ite13_Out-1683294484|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1683294484, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683294484} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1683294484, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683294484, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-1683294484|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 14:19:31,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In1952144989 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1952144989 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In1952144989 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1952144989 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite14_Out1952144989| ~a$r_buff1_thd2~0_In1952144989)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite14_Out1952144989| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1952144989, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1952144989, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1952144989, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1952144989} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1952144989, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1952144989, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1952144989, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out1952144989|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1952144989} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 14:19:31,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_26|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_25|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:19:31,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t52~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t52~0.base_12| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t52~0.base_12| 4)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12| 1) |v_#valid_34|) (= 0 |v_ULTIMATE.start_main_~#t52~0.offset_10|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12|) |v_ULTIMATE.start_main_~#t52~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_12|, ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.base, ULTIMATE.start_main_~#t52~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 14:19:31,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-395014904 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out-395014904| |P2Thread1of1ForFork1_#t~ite20_Out-395014904|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-395014904 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-395014904 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-395014904 256) 0)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-395014904 256) 0)))) (= ~a$w_buff0~0_In-395014904 |P2Thread1of1ForFork1_#t~ite20_Out-395014904|)) (and (= |P2Thread1of1ForFork1_#t~ite20_In-395014904| |P2Thread1of1ForFork1_#t~ite20_Out-395014904|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite21_Out-395014904| ~a$w_buff0~0_In-395014904)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-395014904|, ~a$w_buff0~0=~a$w_buff0~0_In-395014904, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-395014904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-395014904, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-395014904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-395014904, ~weak$$choice2~0=~weak$$choice2~0_In-395014904} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-395014904|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-395014904|, ~a$w_buff0~0=~a$w_buff0~0_In-395014904, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-395014904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-395014904, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-395014904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-395014904, ~weak$$choice2~0=~weak$$choice2~0_In-395014904} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 14:19:31,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In348013608 256)))) (or (and (= ~a$w_buff0_used~0_In348013608 |P2Thread1of1ForFork1_#t~ite27_Out348013608|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In348013608| |P2Thread1of1ForFork1_#t~ite26_Out348013608|)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out348013608| |P2Thread1of1ForFork1_#t~ite26_Out348013608|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In348013608 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In348013608 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In348013608 256))) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In348013608 256))))) (= ~a$w_buff0_used~0_In348013608 |P2Thread1of1ForFork1_#t~ite26_Out348013608|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In348013608|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In348013608, ~a$w_buff0_used~0=~a$w_buff0_used~0_In348013608, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In348013608, ~a$w_buff1_used~0=~a$w_buff1_used~0_In348013608, ~weak$$choice2~0=~weak$$choice2~0_In348013608} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out348013608|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out348013608|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In348013608, ~a$w_buff0_used~0=~a$w_buff0_used~0_In348013608, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In348013608, ~a$w_buff1_used~0=~a$w_buff1_used~0_In348013608, ~weak$$choice2~0=~weak$$choice2~0_In348013608} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 14:19:31,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 14:19:31,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 14:19:31,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1798604312 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1798604312 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out1798604312| ~a~0_In1798604312) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out1798604312| ~a$w_buff1~0_In1798604312)))) InVars {~a~0=~a~0_In1798604312, ~a$w_buff1~0=~a$w_buff1~0_In1798604312, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1798604312, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1798604312} OutVars{~a~0=~a~0_In1798604312, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1798604312|, ~a$w_buff1~0=~a$w_buff1~0_In1798604312, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1798604312, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1798604312} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 14:19:31,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 14:19:31,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In866603883 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In866603883 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out866603883|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In866603883 |P2Thread1of1ForFork1_#t~ite40_Out866603883|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In866603883, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In866603883} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In866603883, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In866603883, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out866603883|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 14:19:31,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1283311795 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1283311795 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1283311795 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In1283311795 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out1283311795| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite41_Out1283311795| ~a$w_buff1_used~0_In1283311795) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1283311795, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1283311795, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1283311795, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1283311795} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1283311795, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1283311795, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1283311795, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1283311795|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1283311795} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 14:19:31,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1823662063 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1823662063 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out1823662063|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out1823662063| ~a$r_buff0_thd3~0_In1823662063) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1823662063, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1823662063} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1823662063|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1823662063, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1823662063} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 14:19:31,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In952519356 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In952519356 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In952519356 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In952519356 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite43_Out952519356| ~a$r_buff1_thd3~0_In952519356) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out952519356|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In952519356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In952519356, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In952519356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In952519356} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out952519356|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In952519356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In952519356, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In952519356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In952519356} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 14:19:31,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_32|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:19:31,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In398999166 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In398999166 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out398999166|) (not .cse1)) (and (= ~a$w_buff0_used~0_In398999166 |P0Thread1of1ForFork2_#t~ite5_Out398999166|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In398999166, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In398999166} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out398999166|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In398999166, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In398999166} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 14:19:31,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1781779805 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In1781779805 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In1781779805 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In1781779805 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out1781779805|)) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1781779805 |P0Thread1of1ForFork2_#t~ite6_Out1781779805|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1781779805, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1781779805, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1781779805, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1781779805} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1781779805, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1781779805|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1781779805, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1781779805, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1781779805} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 14:19:31,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= ~a$r_buff0_thd1~0_In249664020 ~a$r_buff0_thd1~0_Out249664020)) (.cse2 (= (mod ~a$w_buff0_used~0_In249664020 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In249664020 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out249664020)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In249664020, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In249664020} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out249664020|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In249664020, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out249664020} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:19:31,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1864547904 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1864547904 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In1864547904 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1864547904 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite8_Out1864547904| 0)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out1864547904| ~a$r_buff1_thd1~0_In1864547904) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1864547904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1864547904, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1864547904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1864547904} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1864547904|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1864547904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1864547904, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1864547904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1864547904} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 14:19:31,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_42| v_~a$r_buff1_thd1~0_72) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_41|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 14:19:31,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:19:31,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In387451779 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In387451779 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out387451779| ~a$w_buff1~0_In387451779) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out387451779| ~a~0_In387451779) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In387451779, ~a$w_buff1~0=~a$w_buff1~0_In387451779, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In387451779, ~a$w_buff1_used~0=~a$w_buff1_used~0_In387451779} OutVars{~a~0=~a~0_In387451779, ~a$w_buff1~0=~a$w_buff1~0_In387451779, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out387451779|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In387451779, ~a$w_buff1_used~0=~a$w_buff1_used~0_In387451779} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 14:19:31,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 14:19:31,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1420352265 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1420352265 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1420352265| ~a$w_buff0_used~0_In-1420352265) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1420352265| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1420352265, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1420352265} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1420352265, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1420352265|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1420352265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 14:19:31,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In-1884183186 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1884183186 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1884183186 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-1884183186 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1884183186 |ULTIMATE.start_main_#t~ite50_Out-1884183186|)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1884183186| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1884183186, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1884183186, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1884183186, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1884183186} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1884183186|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1884183186, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1884183186, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1884183186, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1884183186} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 14:19:31,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In964371177 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In964371177 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out964371177| ~a$r_buff0_thd0~0_In964371177) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out964371177| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In964371177, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In964371177} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out964371177|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In964371177, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In964371177} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 14:19:31,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1264258673 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1264258673 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1264258673 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1264258673 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1264258673|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-1264258673 |ULTIMATE.start_main_#t~ite52_Out-1264258673|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1264258673, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1264258673, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1264258673, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1264258673} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1264258673|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1264258673, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1264258673, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1264258673, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1264258673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 14:19:31,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:19:31,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:19:31 BasicIcfg [2019-12-07 14:19:31,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:19:31,269 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:19:31,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:19:31,269 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:19:31,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:17:05" (3/4) ... [2019-12-07 14:19:31,271 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:19:31,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_134 0) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23| 1) |v_#valid_62|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t50~0.base_23|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t50~0.base_23|) |v_ULTIMATE.start_main_~#t50~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= (select .cse0 |v_ULTIMATE.start_main_~#t50~0.base_23|) 0) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_ULTIMATE.start_main_~#t50~0.offset_18| 0) (= |v_#NULL.offset_4| 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t50~0.base_23| 4) |v_#length_23|) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_15|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_20|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t50~0.offset=|v_ULTIMATE.start_main_~#t50~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_18|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ULTIMATE.start_main_~#t50~0.base=|v_ULTIMATE.start_main_~#t50~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t52~0.base, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t50~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t51~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t51~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ULTIMATE.start_main_~#t50~0.base, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 14:19:31,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork2_#in~arg.offset_In260881881| P0Thread1of1ForFork2_~arg.offset_Out260881881) (= ~a$w_buff0~0_In260881881 ~a$w_buff1~0_Out260881881) (= ~a$w_buff0~0_Out260881881 1) (= ~a$w_buff0_used~0_In260881881 ~a$w_buff1_used~0_Out260881881) (= 1 ~a$w_buff0_used~0_Out260881881) (= |P0Thread1of1ForFork2_#in~arg.base_In260881881| P0Thread1of1ForFork2_~arg.base_Out260881881) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out260881881 0)) (= (ite (not (and (not (= 0 (mod ~a$w_buff0_used~0_Out260881881 256))) (not (= 0 (mod ~a$w_buff1_used~0_Out260881881 256))))) 1 0) |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out260881881|) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out260881881 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out260881881|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In260881881|, ~a$w_buff0~0=~a$w_buff0~0_In260881881, ~a$w_buff0_used~0=~a$w_buff0_used~0_In260881881, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In260881881|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out260881881, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In260881881|, ~a$w_buff0~0=~a$w_buff0~0_Out260881881, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out260881881, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out260881881, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out260881881, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In260881881|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out260881881, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out260881881, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out260881881|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:19:31,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t51~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t51~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t51~0.base_13| 1) |v_#valid_36|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t51~0.base_13|) |v_ULTIMATE.start_main_~#t51~0.offset_11| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t51~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t51~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t51~0.base=|v_ULTIMATE.start_main_~#t51~0.base_13|, ULTIMATE.start_main_~#t51~0.offset=|v_ULTIMATE.start_main_~#t51~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t51~0.base, ULTIMATE.start_main_~#t51~0.offset] because there is no mapped edge [2019-12-07 14:19:31,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd2~0_In-1736517195 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1736517195 256))) (.cse0 (= |P1Thread1of1ForFork0_#t~ite10_Out-1736517195| |P1Thread1of1ForFork0_#t~ite9_Out-1736517195|))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out-1736517195| ~a$w_buff1~0_In-1736517195) (not .cse2)) (and (or .cse2 .cse1) .cse0 (= |P1Thread1of1ForFork0_#t~ite9_Out-1736517195| ~a~0_In-1736517195)))) InVars {~a~0=~a~0_In-1736517195, ~a$w_buff1~0=~a$w_buff1~0_In-1736517195, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1736517195, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1736517195} OutVars{~a~0=~a~0_In-1736517195, ~a$w_buff1~0=~a$w_buff1~0_In-1736517195, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-1736517195|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1736517195, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1736517195|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1736517195} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 14:19:31,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1298073589 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1298073589 256)))) (or (and (= ~a$w_buff0_used~0_In-1298073589 |P1Thread1of1ForFork0_#t~ite11_Out-1298073589|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-1298073589|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1298073589, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1298073589} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1298073589, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1298073589|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1298073589} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 14:19:31,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In2126512762 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In2126512762 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In2126512762 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In2126512762 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In2126512762 |P1Thread1of1ForFork0_#t~ite12_Out2126512762|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out2126512762|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2126512762, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2126512762, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2126512762, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2126512762} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2126512762, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2126512762, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out2126512762|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2126512762, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2126512762} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 14:19:31,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1683294484 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1683294484 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite13_Out-1683294484| 0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-1683294484 |P1Thread1of1ForFork0_#t~ite13_Out-1683294484|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1683294484, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683294484} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1683294484, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683294484, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-1683294484|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 14:19:31,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In1952144989 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1952144989 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In1952144989 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1952144989 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite14_Out1952144989| ~a$r_buff1_thd2~0_In1952144989)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite14_Out1952144989| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1952144989, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1952144989, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1952144989, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1952144989} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1952144989, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1952144989, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1952144989, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out1952144989|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1952144989} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 14:19:31,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_26|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_25|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 14:19:31,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t52~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t52~0.base_12| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t52~0.base_12| 4)) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12| 1) |v_#valid_34|) (= 0 |v_ULTIMATE.start_main_~#t52~0.offset_10|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t52~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t52~0.base_12|) |v_ULTIMATE.start_main_~#t52~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t52~0.base=|v_ULTIMATE.start_main_~#t52~0.base_12|, ULTIMATE.start_main_~#t52~0.offset=|v_ULTIMATE.start_main_~#t52~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t52~0.base, ULTIMATE.start_main_~#t52~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 14:19:31,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-395014904 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out-395014904| |P2Thread1of1ForFork1_#t~ite20_Out-395014904|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-395014904 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-395014904 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-395014904 256) 0)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-395014904 256) 0)))) (= ~a$w_buff0~0_In-395014904 |P2Thread1of1ForFork1_#t~ite20_Out-395014904|)) (and (= |P2Thread1of1ForFork1_#t~ite20_In-395014904| |P2Thread1of1ForFork1_#t~ite20_Out-395014904|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite21_Out-395014904| ~a$w_buff0~0_In-395014904)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-395014904|, ~a$w_buff0~0=~a$w_buff0~0_In-395014904, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-395014904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-395014904, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-395014904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-395014904, ~weak$$choice2~0=~weak$$choice2~0_In-395014904} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-395014904|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-395014904|, ~a$w_buff0~0=~a$w_buff0~0_In-395014904, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-395014904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-395014904, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-395014904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-395014904, ~weak$$choice2~0=~weak$$choice2~0_In-395014904} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 14:19:31,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In348013608 256)))) (or (and (= ~a$w_buff0_used~0_In348013608 |P2Thread1of1ForFork1_#t~ite27_Out348013608|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In348013608| |P2Thread1of1ForFork1_#t~ite26_Out348013608|)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out348013608| |P2Thread1of1ForFork1_#t~ite26_Out348013608|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In348013608 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In348013608 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In348013608 256))) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In348013608 256))))) (= ~a$w_buff0_used~0_In348013608 |P2Thread1of1ForFork1_#t~ite26_Out348013608|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In348013608|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In348013608, ~a$w_buff0_used~0=~a$w_buff0_used~0_In348013608, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In348013608, ~a$w_buff1_used~0=~a$w_buff1_used~0_In348013608, ~weak$$choice2~0=~weak$$choice2~0_In348013608} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out348013608|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out348013608|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In348013608, ~a$w_buff0_used~0=~a$w_buff0_used~0_In348013608, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In348013608, ~a$w_buff1_used~0=~a$w_buff1_used~0_In348013608, ~weak$$choice2~0=~weak$$choice2~0_In348013608} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 14:19:31,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 14:19:31,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 14:19:31,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1798604312 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1798604312 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out1798604312| ~a~0_In1798604312) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out1798604312| ~a$w_buff1~0_In1798604312)))) InVars {~a~0=~a~0_In1798604312, ~a$w_buff1~0=~a$w_buff1~0_In1798604312, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1798604312, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1798604312} OutVars{~a~0=~a~0_In1798604312, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1798604312|, ~a$w_buff1~0=~a$w_buff1~0_In1798604312, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1798604312, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1798604312} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 14:19:31,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 14:19:31,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In866603883 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In866603883 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out866603883|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In866603883 |P2Thread1of1ForFork1_#t~ite40_Out866603883|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In866603883, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In866603883} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In866603883, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In866603883, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out866603883|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 14:19:31,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1283311795 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1283311795 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1283311795 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In1283311795 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out1283311795| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite41_Out1283311795| ~a$w_buff1_used~0_In1283311795) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1283311795, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1283311795, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1283311795, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1283311795} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1283311795, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1283311795, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1283311795, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1283311795|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1283311795} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 14:19:31,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1823662063 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1823662063 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out1823662063|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out1823662063| ~a$r_buff0_thd3~0_In1823662063) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1823662063, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1823662063} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1823662063|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1823662063, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1823662063} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 14:19:31,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In952519356 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In952519356 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In952519356 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In952519356 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite43_Out952519356| ~a$r_buff1_thd3~0_In952519356) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out952519356|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In952519356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In952519356, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In952519356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In952519356} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out952519356|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In952519356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In952519356, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In952519356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In952519356} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 14:19:31,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_32|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:19:31,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In398999166 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In398999166 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out398999166|) (not .cse1)) (and (= ~a$w_buff0_used~0_In398999166 |P0Thread1of1ForFork2_#t~ite5_Out398999166|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In398999166, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In398999166} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out398999166|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In398999166, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In398999166} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 14:19:31,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1781779805 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In1781779805 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In1781779805 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In1781779805 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out1781779805|)) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1781779805 |P0Thread1of1ForFork2_#t~ite6_Out1781779805|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1781779805, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1781779805, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1781779805, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1781779805} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1781779805, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1781779805|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1781779805, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1781779805, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1781779805} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 14:19:31,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse0 (= ~a$r_buff0_thd1~0_In249664020 ~a$r_buff0_thd1~0_Out249664020)) (.cse2 (= (mod ~a$w_buff0_used~0_In249664020 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In249664020 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out249664020)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In249664020, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In249664020} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out249664020|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In249664020, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out249664020} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:19:31,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1864547904 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1864547904 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In1864547904 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1864547904 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite8_Out1864547904| 0)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out1864547904| ~a$r_buff1_thd1~0_In1864547904) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1864547904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1864547904, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1864547904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1864547904} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1864547904|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1864547904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1864547904, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1864547904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1864547904} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 14:19:31,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_42| v_~a$r_buff1_thd1~0_72) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_41|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 14:19:31,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 14:19:31,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In387451779 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In387451779 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out387451779| ~a$w_buff1~0_In387451779) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out387451779| ~a~0_In387451779) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In387451779, ~a$w_buff1~0=~a$w_buff1~0_In387451779, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In387451779, ~a$w_buff1_used~0=~a$w_buff1_used~0_In387451779} OutVars{~a~0=~a~0_In387451779, ~a$w_buff1~0=~a$w_buff1~0_In387451779, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out387451779|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In387451779, ~a$w_buff1_used~0=~a$w_buff1_used~0_In387451779} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 14:19:31,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 14:19:31,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1420352265 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1420352265 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1420352265| ~a$w_buff0_used~0_In-1420352265) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1420352265| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1420352265, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1420352265} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1420352265, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1420352265|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1420352265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 14:19:31,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In-1884183186 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1884183186 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1884183186 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-1884183186 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1884183186 |ULTIMATE.start_main_#t~ite50_Out-1884183186|)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1884183186| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1884183186, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1884183186, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1884183186, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1884183186} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1884183186|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1884183186, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1884183186, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1884183186, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1884183186} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 14:19:31,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In964371177 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In964371177 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out964371177| ~a$r_buff0_thd0~0_In964371177) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out964371177| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In964371177, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In964371177} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out964371177|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In964371177, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In964371177} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 14:19:31,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1264258673 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1264258673 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1264258673 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1264258673 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1264258673|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-1264258673 |ULTIMATE.start_main_#t~ite52_Out-1264258673|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1264258673, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1264258673, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1264258673, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1264258673} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1264258673|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1264258673, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1264258673, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1264258673, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1264258673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 14:19:31,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:19:31,367 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_81474665-fb41-4b86-a473-2835c2a2aef2/bin/uautomizer/witness.graphml [2019-12-07 14:19:31,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:19:31,368 INFO L168 Benchmark]: Toolchain (without parser) took 146923.78 ms. Allocated memory was 1.0 GB in the beginning and 7.1 GB in the end (delta: 6.1 GB). Free memory was 939.7 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 14:19:31,368 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:19:31,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:19:31,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.36 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:19:31,369 INFO L168 Benchmark]: Boogie Preprocessor took 26.33 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:19:31,369 INFO L168 Benchmark]: RCFGBuilder took 413.35 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: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:19:31,369 INFO L168 Benchmark]: TraceAbstraction took 145959.17 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 14:19:31,369 INFO L168 Benchmark]: Witness Printer took 98.13 ms. Allocated memory is still 7.1 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:19:31,371 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.36 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. * Boogie Preprocessor took 26.33 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 413.35 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: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 145959.17 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 98.13 ms. Allocated memory is still 7.1 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t50, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t51, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t52, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 145.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8020 SDtfs, 9223 SDslu, 32830 SDs, 0 SdLazy, 24153 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 44 SyntacticMatches, 21 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2366 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219155occurred 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: 87.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 355930 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1424 NumberOfCodeBlocks, 1424 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1327 ConstructedInterpolants, 0 QuantifiedInterpolants, 571768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...