/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:30:35,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:30:35,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:30:35,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:30:35,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:30:35,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:30:35,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:30:35,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:30:35,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:30:35,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:30:35,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:30:35,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:30:35,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:30:35,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:30:35,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:30:35,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:30:35,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:30:35,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:30:35,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:30:35,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:30:35,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:30:35,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:30:35,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:30:35,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:30:35,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:30:35,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:30:35,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:30:35,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:30:35,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:30:35,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:30:35,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:30:35,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:30:35,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:30:35,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:30:35,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:30:35,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:30:35,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:30:35,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:30:35,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:30:35,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:30:35,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:30:35,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:30:36,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:30:36,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:30:36,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:30:36,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:30:36,004 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:30:36,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:30:36,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:30:36,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:30:36,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:30:36,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:30:36,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:30:36,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:30:36,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:30:36,006 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:30:36,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:30:36,006 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:30:36,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:30:36,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:30:36,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:30:36,007 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:30:36,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:30:36,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:30:36,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:30:36,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:30:36,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:30:36,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:30:36,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:30:36,010 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:30:36,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:30:36,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:30:36,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:30:36,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:30:36,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:30:36,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:30:36,321 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:30:36,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2019-12-18 21:30:36,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441f726e0/2bb1031655274a79b129575ae80c4ef5/FLAG2793107a0 [2019-12-18 21:30:37,002 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:30:37,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2019-12-18 21:30:37,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441f726e0/2bb1031655274a79b129575ae80c4ef5/FLAG2793107a0 [2019-12-18 21:30:37,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441f726e0/2bb1031655274a79b129575ae80c4ef5 [2019-12-18 21:30:37,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:30:37,257 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:30:37,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:30:37,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:30:37,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:30:37,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:30:37" (1/1) ... [2019-12-18 21:30:37,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116f9d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:37, skipping insertion in model container [2019-12-18 21:30:37,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:30:37" (1/1) ... [2019-12-18 21:30:37,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:30:37,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:30:37,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:30:37,940 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:30:38,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:30:38,087 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:30:38,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38 WrapperNode [2019-12-18 21:30:38,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:30:38,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:30:38,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:30:38,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:30:38,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... [2019-12-18 21:30:38,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... [2019-12-18 21:30:38,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:30:38,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:30:38,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:30:38,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:30:38,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... [2019-12-18 21:30:38,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... [2019-12-18 21:30:38,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... [2019-12-18 21:30:38,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... [2019-12-18 21:30:38,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... [2019-12-18 21:30:38,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... [2019-12-18 21:30:38,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... [2019-12-18 21:30:38,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:30:38,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:30:38,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:30:38,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:30:38,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-18 21:30:38,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:30:38,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:30:38,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:30:38,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:30:38,276 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:30:38,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:30:38,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:30:38,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:30:38,278 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:30:38,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:30:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:30:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:30:38,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:30:38,283 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:30:39,026 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:30:39,027 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:30:39,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:30:39 BoogieIcfgContainer [2019-12-18 21:30:39,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:30:39,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:30:39,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:30:39,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:30:39,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:30:37" (1/3) ... [2019-12-18 21:30:39,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52446467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:30:39, skipping insertion in model container [2019-12-18 21:30:39,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:38" (2/3) ... [2019-12-18 21:30:39,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52446467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:30:39, skipping insertion in model container [2019-12-18 21:30:39,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:30:39" (3/3) ... [2019-12-18 21:30:39,037 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2019-12-18 21:30:39,048 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:30:39,048 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:30:39,057 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:30:39,058 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:30:39,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,107 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,107 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,118 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,119 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,120 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,126 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,127 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:30:39,167 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:30:39,187 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:30:39,188 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:30:39,188 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:30:39,188 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:30:39,188 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:30:39,188 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:30:39,189 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:30:39,189 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:30:39,206 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 21:30:39,208 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 21:30:39,292 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 21:30:39,292 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:30:39,307 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:30:39,326 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 21:30:39,367 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 21:30:39,368 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:30:39,374 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:30:39,388 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:30:39,389 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:30:42,976 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 21:30:43,101 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:30:43,120 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48939 [2019-12-18 21:30:43,120 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 21:30:43,124 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-18 21:30:44,316 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 17702 states. [2019-12-18 21:30:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states. [2019-12-18 21:30:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:30:44,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:44,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:44,326 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:44,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1021258717, now seen corresponding path program 1 times [2019-12-18 21:30:44,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:44,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107813941] [2019-12-18 21:30:44,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:44,610 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-18 21:30:44,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107813941] [2019-12-18 21:30:44,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:44,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:30:44,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194666885] [2019-12-18 21:30:44,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:44,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:44,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:44,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:44,637 INFO L87 Difference]: Start difference. First operand 17702 states. Second operand 3 states. [2019-12-18 21:30:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:45,018 INFO L93 Difference]: Finished difference Result 17518 states and 65786 transitions. [2019-12-18 21:30:45,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:45,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:30:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:45,278 INFO L225 Difference]: With dead ends: 17518 [2019-12-18 21:30:45,281 INFO L226 Difference]: Without dead ends: 17154 [2019-12-18 21:30:45,282 INFO L631 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-18 21:30:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2019-12-18 21:30:46,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2019-12-18 21:30:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2019-12-18 21:30:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 64484 transitions. [2019-12-18 21:30:46,995 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 64484 transitions. Word has length 7 [2019-12-18 21:30:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:46,997 INFO L462 AbstractCegarLoop]: Abstraction has 17154 states and 64484 transitions. [2019-12-18 21:30:46,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 64484 transitions. [2019-12-18 21:30:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:30:47,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:47,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:47,003 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1042029575, now seen corresponding path program 1 times [2019-12-18 21:30:47,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:47,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229352393] [2019-12-18 21:30:47,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:47,161 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-18 21:30:47,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229352393] [2019-12-18 21:30:47,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:47,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:30:47,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18113286] [2019-12-18 21:30:47,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:30:47,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:47,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:30:47,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:30:47,166 INFO L87 Difference]: Start difference. First operand 17154 states and 64484 transitions. Second operand 4 states. [2019-12-18 21:30:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:47,680 INFO L93 Difference]: Finished difference Result 26570 states and 95594 transitions. [2019-12-18 21:30:47,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:30:47,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:30:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:47,790 INFO L225 Difference]: With dead ends: 26570 [2019-12-18 21:30:47,790 INFO L226 Difference]: Without dead ends: 26556 [2019-12-18 21:30:47,791 INFO L631 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-18 21:30:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-18 21:30:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 24300. [2019-12-18 21:30:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-18 21:30:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 88453 transitions. [2019-12-18 21:30:50,178 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 88453 transitions. Word has length 13 [2019-12-18 21:30:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:50,178 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 88453 transitions. [2019-12-18 21:30:50,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:30:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 88453 transitions. [2019-12-18 21:30:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:30:50,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:50,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:50,182 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1362987190, now seen corresponding path program 1 times [2019-12-18 21:30:50,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:50,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099556977] [2019-12-18 21:30:50,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:50,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-18 21:30:50,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099556977] [2019-12-18 21:30:50,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:50,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:30:50,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353391137] [2019-12-18 21:30:50,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:50,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:50,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:50,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:50,233 INFO L87 Difference]: Start difference. First operand 24300 states and 88453 transitions. Second operand 3 states. [2019-12-18 21:30:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:50,305 INFO L93 Difference]: Finished difference Result 13809 states and 43497 transitions. [2019-12-18 21:30:50,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:50,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:30:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:50,367 INFO L225 Difference]: With dead ends: 13809 [2019-12-18 21:30:50,368 INFO L226 Difference]: Without dead ends: 13809 [2019-12-18 21:30:50,368 INFO L631 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-18 21:30:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-18 21:30:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13809. [2019-12-18 21:30:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-18 21:30:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 43497 transitions. [2019-12-18 21:30:50,710 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 43497 transitions. Word has length 13 [2019-12-18 21:30:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:50,713 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 43497 transitions. [2019-12-18 21:30:50,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 43497 transitions. [2019-12-18 21:30:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:30:50,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:50,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:50,725 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:50,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:50,728 INFO L82 PathProgramCache]: Analyzing trace with hash -824782782, now seen corresponding path program 1 times [2019-12-18 21:30:50,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:50,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016749208] [2019-12-18 21:30:50,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:50,785 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-18 21:30:50,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016749208] [2019-12-18 21:30:50,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:50,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:30:50,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121108466] [2019-12-18 21:30:50,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:30:50,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:50,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:30:50,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:30:50,787 INFO L87 Difference]: Start difference. First operand 13809 states and 43497 transitions. Second operand 4 states. [2019-12-18 21:30:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:50,809 INFO L93 Difference]: Finished difference Result 2006 states and 4674 transitions. [2019-12-18 21:30:50,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:30:50,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:30:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:50,814 INFO L225 Difference]: With dead ends: 2006 [2019-12-18 21:30:50,815 INFO L226 Difference]: Without dead ends: 2006 [2019-12-18 21:30:50,815 INFO L631 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-18 21:30:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-18 21:30:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2019-12-18 21:30:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-12-18 21:30:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4674 transitions. [2019-12-18 21:30:50,847 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4674 transitions. Word has length 14 [2019-12-18 21:30:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:50,847 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 4674 transitions. [2019-12-18 21:30:50,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:30:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4674 transitions. [2019-12-18 21:30:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:30:50,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:50,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:50,850 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1888947731, now seen corresponding path program 1 times [2019-12-18 21:30:50,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:50,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992572879] [2019-12-18 21:30:50,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:50,947 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-18 21:30:50,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992572879] [2019-12-18 21:30:50,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:50,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:30:50,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775101938] [2019-12-18 21:30:50,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:30:50,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:30:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:30:50,950 INFO L87 Difference]: Start difference. First operand 2006 states and 4674 transitions. Second operand 5 states. [2019-12-18 21:30:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:50,983 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-18 21:30:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:30:50,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:30:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:50,985 INFO L225 Difference]: With dead ends: 653 [2019-12-18 21:30:50,986 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 21:30:50,986 INFO L631 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-18 21:30:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 21:30:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-18 21:30:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-18 21:30:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-18 21:30:50,997 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-18 21:30:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:50,997 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-18 21:30:50,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:30:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-18 21:30:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:51,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:51,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:51,002 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1558229958, now seen corresponding path program 1 times [2019-12-18 21:30:51,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:51,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566840128] [2019-12-18 21:30:51,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:51,251 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-18 21:30:51,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566840128] [2019-12-18 21:30:51,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:51,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:30:51,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062606140] [2019-12-18 21:30:51,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:51,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:51,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:51,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:51,255 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-18 21:30:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:51,319 INFO L93 Difference]: Finished difference Result 609 states and 1418 transitions. [2019-12-18 21:30:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:51,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:30:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:51,322 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:30:51,323 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:30:51,323 INFO L631 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-18 21:30:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:30:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:30:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:30:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1414 transitions. [2019-12-18 21:30:51,333 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1414 transitions. Word has length 55 [2019-12-18 21:30:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:51,334 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1414 transitions. [2019-12-18 21:30:51,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1414 transitions. [2019-12-18 21:30:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:51,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:51,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:51,336 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:51,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1993278178, now seen corresponding path program 1 times [2019-12-18 21:30:51,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:51,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010693757] [2019-12-18 21:30:51,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:51,428 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-18 21:30:51,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010693757] [2019-12-18 21:30:51,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:51,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:30:51,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877269822] [2019-12-18 21:30:51,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:51,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:51,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:51,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:51,430 INFO L87 Difference]: Start difference. First operand 605 states and 1414 transitions. Second operand 3 states. [2019-12-18 21:30:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:51,473 INFO L93 Difference]: Finished difference Result 609 states and 1411 transitions. [2019-12-18 21:30:51,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:51,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:30:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:51,475 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:30:51,475 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:30:51,476 INFO L631 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-18 21:30:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:30:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:30:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:30:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1407 transitions. [2019-12-18 21:30:51,486 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1407 transitions. Word has length 55 [2019-12-18 21:30:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:51,487 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1407 transitions. [2019-12-18 21:30:51,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1407 transitions. [2019-12-18 21:30:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:51,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:51,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:51,489 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1988838358, now seen corresponding path program 1 times [2019-12-18 21:30:51,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:51,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220494453] [2019-12-18 21:30:51,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:51,601 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-18 21:30:51,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220494453] [2019-12-18 21:30:51,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:51,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:30:51,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269224070] [2019-12-18 21:30:51,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:30:51,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:30:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:30:51,604 INFO L87 Difference]: Start difference. First operand 605 states and 1407 transitions. Second operand 5 states. [2019-12-18 21:30:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:51,823 INFO L93 Difference]: Finished difference Result 894 states and 2079 transitions. [2019-12-18 21:30:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:30:51,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 21:30:51,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:51,825 INFO L225 Difference]: With dead ends: 894 [2019-12-18 21:30:51,825 INFO L226 Difference]: Without dead ends: 894 [2019-12-18 21:30:51,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:30:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-18 21:30:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-18 21:30:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-18 21:30:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1688 transitions. [2019-12-18 21:30:51,851 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1688 transitions. Word has length 55 [2019-12-18 21:30:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:51,851 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1688 transitions. [2019-12-18 21:30:51,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:30:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1688 transitions. [2019-12-18 21:30:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:30:51,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:51,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:30:51,861 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:51,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:51,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2112589232, now seen corresponding path program 2 times [2019-12-18 21:30:51,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:51,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473274116] [2019-12-18 21:30:51,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:51,986 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-18 21:30:51,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473274116] [2019-12-18 21:30:51,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:51,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:30:51,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563724468] [2019-12-18 21:30:51,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:51,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:51,988 INFO L87 Difference]: Start difference. First operand 719 states and 1688 transitions. Second operand 3 states. [2019-12-18 21:30:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:52,038 INFO L93 Difference]: Finished difference Result 719 states and 1687 transitions. [2019-12-18 21:30:52,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:52,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:30:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:52,040 INFO L225 Difference]: With dead ends: 719 [2019-12-18 21:30:52,040 INFO L226 Difference]: Without dead ends: 719 [2019-12-18 21:30:52,040 INFO L631 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-18 21:30:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-12-18 21:30:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 536. [2019-12-18 21:30:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 21:30:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1264 transitions. [2019-12-18 21:30:52,054 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1264 transitions. Word has length 55 [2019-12-18 21:30:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:52,054 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1264 transitions. [2019-12-18 21:30:52,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1264 transitions. [2019-12-18 21:30:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:30:52,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:52,057 INFO L411 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] [2019-12-18 21:30:52,058 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:52,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash 966806383, now seen corresponding path program 1 times [2019-12-18 21:30:52,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:52,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034907039] [2019-12-18 21:30:52,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:52,221 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-18 21:30:52,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034907039] [2019-12-18 21:30:52,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:52,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:30:52,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30056121] [2019-12-18 21:30:52,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:30:52,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:52,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:30:52,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:30:52,223 INFO L87 Difference]: Start difference. First operand 536 states and 1264 transitions. Second operand 6 states. [2019-12-18 21:30:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:52,308 INFO L93 Difference]: Finished difference Result 906 states and 2043 transitions. [2019-12-18 21:30:52,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:30:52,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 21:30:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:52,310 INFO L225 Difference]: With dead ends: 906 [2019-12-18 21:30:52,310 INFO L226 Difference]: Without dead ends: 372 [2019-12-18 21:30:52,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:30:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-18 21:30:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 319. [2019-12-18 21:30:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-18 21:30:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 591 transitions. [2019-12-18 21:30:52,316 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 591 transitions. Word has length 56 [2019-12-18 21:30:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:52,316 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 591 transitions. [2019-12-18 21:30:52,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:30:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 591 transitions. [2019-12-18 21:30:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:30:52,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:52,318 INFO L411 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] [2019-12-18 21:30:52,318 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash 256747969, now seen corresponding path program 2 times [2019-12-18 21:30:52,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:52,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52735546] [2019-12-18 21:30:52,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:52,385 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-18 21:30:52,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52735546] [2019-12-18 21:30:52,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:52,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:30:52,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057592900] [2019-12-18 21:30:52,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:30:52,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:30:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:30:52,387 INFO L87 Difference]: Start difference. First operand 319 states and 591 transitions. Second operand 3 states. [2019-12-18 21:30:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:52,404 INFO L93 Difference]: Finished difference Result 307 states and 552 transitions. [2019-12-18 21:30:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:30:52,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:30:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:52,405 INFO L225 Difference]: With dead ends: 307 [2019-12-18 21:30:52,405 INFO L226 Difference]: Without dead ends: 307 [2019-12-18 21:30:52,405 INFO L631 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-18 21:30:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-18 21:30:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 280. [2019-12-18 21:30:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-18 21:30:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 501 transitions. [2019-12-18 21:30:52,410 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 501 transitions. Word has length 56 [2019-12-18 21:30:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:52,411 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 501 transitions. [2019-12-18 21:30:52,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:30:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 501 transitions. [2019-12-18 21:30:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:30:52,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:52,412 INFO L411 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] [2019-12-18 21:30:52,412 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:52,413 INFO L82 PathProgramCache]: Analyzing trace with hash 776087573, now seen corresponding path program 1 times [2019-12-18 21:30:52,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:52,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075803685] [2019-12-18 21:30:52,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:53,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-18 21:30:53,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075803685] [2019-12-18 21:30:53,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:53,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:30:53,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468166222] [2019-12-18 21:30:53,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:30:53,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:53,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:30:53,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:30:53,235 INFO L87 Difference]: Start difference. First operand 280 states and 501 transitions. Second operand 18 states. [2019-12-18 21:30:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:54,746 INFO L93 Difference]: Finished difference Result 690 states and 1221 transitions. [2019-12-18 21:30:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 21:30:54,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-18 21:30:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:54,748 INFO L225 Difference]: With dead ends: 690 [2019-12-18 21:30:54,748 INFO L226 Difference]: Without dead ends: 656 [2019-12-18 21:30:54,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:30:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-12-18 21:30:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 386. [2019-12-18 21:30:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-18 21:30:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 682 transitions. [2019-12-18 21:30:54,757 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 682 transitions. Word has length 57 [2019-12-18 21:30:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:54,758 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 682 transitions. [2019-12-18 21:30:54,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:30:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 682 transitions. [2019-12-18 21:30:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:30:54,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:54,759 INFO L411 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] [2019-12-18 21:30:54,760 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:54,760 INFO L82 PathProgramCache]: Analyzing trace with hash 155274265, now seen corresponding path program 2 times [2019-12-18 21:30:54,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:54,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422496857] [2019-12-18 21:30:54,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:30:55,062 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-18 21:30:55,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422496857] [2019-12-18 21:30:55,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:30:55,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:30:55,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509451201] [2019-12-18 21:30:55,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:30:55,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:30:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:30:55,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:30:55,065 INFO L87 Difference]: Start difference. First operand 386 states and 682 transitions. Second operand 13 states. [2019-12-18 21:30:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:30:55,794 INFO L93 Difference]: Finished difference Result 658 states and 1131 transitions. [2019-12-18 21:30:55,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:30:55,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 21:30:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:30:55,796 INFO L225 Difference]: With dead ends: 658 [2019-12-18 21:30:55,796 INFO L226 Difference]: Without dead ends: 624 [2019-12-18 21:30:55,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:30:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-12-18 21:30:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 414. [2019-12-18 21:30:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-18 21:30:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 736 transitions. [2019-12-18 21:30:55,809 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 736 transitions. Word has length 57 [2019-12-18 21:30:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:30:55,809 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 736 transitions. [2019-12-18 21:30:55,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:30:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 736 transitions. [2019-12-18 21:30:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:30:55,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:30:55,811 INFO L411 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] [2019-12-18 21:30:55,811 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:30:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:30:55,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1732220053, now seen corresponding path program 3 times [2019-12-18 21:30:55,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:30:55,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343876756] [2019-12-18 21:30:55,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:30:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:30:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:30:55,935 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:30:55,936 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:30:55,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$w_buff1~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~y$r_buff0_thd2~0_20 0) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~y$r_buff1_thd0~0_51) (= (store .cse0 |v_ULTIMATE.start_main_~#t1202~0.base_25| 1) |v_#valid_62|) (= v_~y$w_buff0_used~0_108 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$flush_delayed~0_14) (= |v_ULTIMATE.start_main_~#t1202~0.offset_19| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1202~0.base_25| 4)) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y$r_buff0_thd0~0_80 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1202~0.base_25|)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$mem_tmp~0_10 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~y~0_26 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1202~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1202~0.base_25|) |v_ULTIMATE.start_main_~#t1202~0.offset_19| 0)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1202~0.base_25|) (= v_~y$r_buff0_thd1~0_6 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t1204~0.base=|v_ULTIMATE.start_main_~#t1204~0.base_25|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t1204~0.offset=|v_ULTIMATE.start_main_~#t1204~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_~#t1202~0.base=|v_ULTIMATE.start_main_~#t1202~0.base_25|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1203~0.base=|v_ULTIMATE.start_main_~#t1203~0.base_25|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, ULTIMATE.start_main_~#t1203~0.offset=|v_ULTIMATE.start_main_~#t1203~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_~#t1202~0.offset=|v_ULTIMATE.start_main_~#t1202~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1204~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1204~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1202~0.base, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1203~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1203~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1202~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:30:55,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1203~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1203~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1203~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1203~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1203~0.base_13|) |v_ULTIMATE.start_main_~#t1203~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1203~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1203~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1203~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1203~0.base=|v_ULTIMATE.start_main_~#t1203~0.base_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1203~0.offset=|v_ULTIMATE.start_main_~#t1203~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1203~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1203~0.offset] because there is no mapped edge [2019-12-18 21:30:55,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L812-1-->L814: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1204~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1204~0.base_13|) |v_ULTIMATE.start_main_~#t1204~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1204~0.base_13|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1204~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1204~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1204~0.base_13| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1204~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1204~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1204~0.offset=|v_ULTIMATE.start_main_~#t1204~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1204~0.base=|v_ULTIMATE.start_main_~#t1204~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1204~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1204~0.base] because there is no mapped edge [2019-12-18 21:30:55,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6) (= 1 v_~y$w_buff0_used~0_77) (= 2 v_~y$w_buff0~0_14) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_78) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:30:55,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:30:55,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In375041609 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In375041609 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out375041609| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out375041609| ~y$w_buff0_used~0_In375041609)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In375041609, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In375041609} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In375041609, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out375041609|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In375041609} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 21:30:55,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In573645299 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In573645299 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In573645299 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In573645299 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out573645299| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out573645299| ~y$w_buff1_used~0_In573645299) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In573645299, ~y$w_buff0_used~0=~y$w_buff0_used~0_In573645299, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In573645299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In573645299} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In573645299, ~y$w_buff0_used~0=~y$w_buff0_used~0_In573645299, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out573645299|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In573645299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In573645299} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:30:55,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1016251823 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1016251823 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1016251823 ~y$r_buff0_thd3~0_Out-1016251823)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-1016251823)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1016251823, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1016251823} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1016251823, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1016251823, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1016251823|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 21:30:55,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-91522726 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-91522726 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-91522726 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-91522726 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-91522726|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite14_Out-91522726| ~y$r_buff1_thd3~0_In-91522726) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-91522726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-91522726, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-91522726, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-91522726} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-91522726|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-91522726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-91522726, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-91522726, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-91522726} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 21:30:55,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:30:55,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-871371069 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-871371069 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-871371069 |P1Thread1of1ForFork2_#t~ite3_Out-871371069|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-871371069 |P1Thread1of1ForFork2_#t~ite3_Out-871371069|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-871371069, ~y$w_buff1~0=~y$w_buff1~0_In-871371069, ~y~0=~y~0_In-871371069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-871371069} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-871371069, ~y$w_buff1~0=~y$w_buff1~0_In-871371069, ~y~0=~y~0_In-871371069, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-871371069|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-871371069} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:30:55,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:30:55,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-39037232 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-39037232 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out-39037232| ~y$w_buff0_used~0_In-39037232) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-39037232|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-39037232, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-39037232} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-39037232, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-39037232, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-39037232|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:30:55,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1595074549 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1595074549 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1595074549 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1595074549 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1595074549 |P1Thread1of1ForFork2_#t~ite6_Out1595074549|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out1595074549|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1595074549, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1595074549, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1595074549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595074549} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1595074549, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1595074549, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1595074549, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1595074549|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595074549} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:30:55,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In901005081 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In901005081 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out901005081| ~y$r_buff0_thd2~0_In901005081)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out901005081| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In901005081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901005081} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In901005081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901005081, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out901005081|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:30:55,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-64910365 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-64910365 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-64910365 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-64910365 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-64910365 |P1Thread1of1ForFork2_#t~ite8_Out-64910365|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out-64910365| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-64910365, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64910365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-64910365, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64910365} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-64910365, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64910365, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-64910365|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-64910365, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64910365} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:30:55,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:30:55,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:30:55,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out471397409| |ULTIMATE.start_main_#t~ite18_Out471397409|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In471397409 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In471397409 256) 0))) (or (and (= ~y$w_buff1~0_In471397409 |ULTIMATE.start_main_#t~ite18_Out471397409|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= ~y~0_In471397409 |ULTIMATE.start_main_#t~ite18_Out471397409|) (or .cse2 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In471397409, ~y~0=~y~0_In471397409, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In471397409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In471397409} OutVars{~y$w_buff1~0=~y$w_buff1~0_In471397409, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out471397409|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out471397409|, ~y~0=~y~0_In471397409, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In471397409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In471397409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:30:55,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In267370042 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In267370042 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In267370042 |ULTIMATE.start_main_#t~ite20_Out267370042|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out267370042|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In267370042, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In267370042} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In267370042, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In267370042, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out267370042|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:30:55,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1402986679 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1402986679 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1402986679 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1402986679 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1402986679 |ULTIMATE.start_main_#t~ite21_Out-1402986679|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1402986679| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1402986679, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1402986679, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1402986679, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1402986679} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1402986679, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1402986679, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1402986679|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1402986679, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1402986679} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:30:55,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-455265754 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-455265754 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out-455265754|)) (and (= |ULTIMATE.start_main_#t~ite22_Out-455265754| ~y$r_buff0_thd0~0_In-455265754) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-455265754, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-455265754} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-455265754, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-455265754, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-455265754|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:30:55,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1675723417 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1675723417 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1675723417 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1675723417 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1675723417 |ULTIMATE.start_main_#t~ite23_Out1675723417|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1675723417|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1675723417, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1675723417, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1675723417, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1675723417} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1675723417, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1675723417, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1675723417, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1675723417|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1675723417} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:30:55,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L833-->L833-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1594306764 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1594306764 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1594306764 256))) (and .cse0 (= (mod ~y$w_buff1_used~0_In1594306764 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1594306764 256)))) (= |ULTIMATE.start_main_#t~ite32_Out1594306764| |ULTIMATE.start_main_#t~ite33_Out1594306764|) (= |ULTIMATE.start_main_#t~ite32_Out1594306764| ~y$w_buff1~0_In1594306764) .cse1) (and (= ~y$w_buff1~0_In1594306764 |ULTIMATE.start_main_#t~ite33_Out1594306764|) (not .cse1) (= |ULTIMATE.start_main_#t~ite32_In1594306764| |ULTIMATE.start_main_#t~ite32_Out1594306764|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1594306764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1594306764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1594306764, ~weak$$choice2~0=~weak$$choice2~0_In1594306764, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1594306764, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In1594306764|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1594306764} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1594306764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1594306764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1594306764, ~weak$$choice2~0=~weak$$choice2~0_In1594306764, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1594306764|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1594306764, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1594306764|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1594306764} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 21:30:55,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1835490774 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_In1835490774| |ULTIMATE.start_main_#t~ite35_Out1835490774|) (= |ULTIMATE.start_main_#t~ite36_Out1835490774| ~y$w_buff0_used~0_In1835490774) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite36_Out1835490774| |ULTIMATE.start_main_#t~ite35_Out1835490774|) (= ~y$w_buff0_used~0_In1835490774 |ULTIMATE.start_main_#t~ite35_Out1835490774|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1835490774 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1835490774 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1835490774 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In1835490774 256) 0))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1835490774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1835490774, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1835490774|, ~weak$$choice2~0=~weak$$choice2~0_In1835490774, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1835490774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835490774} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1835490774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1835490774, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1835490774|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1835490774|, ~weak$$choice2~0=~weak$$choice2~0_In1835490774, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1835490774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835490774} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:30:55,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L835-->L835-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In72166510 256)))) (or (and (not .cse0) (= ~y$w_buff1_used~0_In72166510 |ULTIMATE.start_main_#t~ite39_Out72166510|) (= |ULTIMATE.start_main_#t~ite38_In72166510| |ULTIMATE.start_main_#t~ite38_Out72166510|)) (and (= ~y$w_buff1_used~0_In72166510 |ULTIMATE.start_main_#t~ite38_Out72166510|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In72166510 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In72166510 256))) (and (= 0 (mod ~y$w_buff1_used~0_In72166510 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In72166510 256)))) (= |ULTIMATE.start_main_#t~ite39_Out72166510| |ULTIMATE.start_main_#t~ite38_Out72166510|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In72166510, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In72166510, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In72166510|, ~weak$$choice2~0=~weak$$choice2~0_In72166510, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In72166510, ~y$w_buff1_used~0=~y$w_buff1_used~0_In72166510} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In72166510, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out72166510|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In72166510, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out72166510|, ~weak$$choice2~0=~weak$$choice2~0_In72166510, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In72166510, ~y$w_buff1_used~0=~y$w_buff1_used~0_In72166510} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:30:55,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_64 v_~y$r_buff0_thd0~0_63)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:30:55,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L839-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:30:55,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:30:56,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:30:56 BasicIcfg [2019-12-18 21:30:56,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:30:56,041 INFO L168 Benchmark]: Toolchain (without parser) took 18783.82 ms. Allocated memory was 138.9 MB in the beginning and 873.5 MB in the end (delta: 734.5 MB). Free memory was 102.4 MB in the beginning and 257.9 MB in the end (delta: -155.4 MB). Peak memory consumption was 579.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:56,041 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:30:56,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.44 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 156.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:56,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.99 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:56,044 INFO L168 Benchmark]: Boogie Preprocessor took 37.56 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:56,045 INFO L168 Benchmark]: RCFGBuilder took 828.55 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 104.3 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:56,046 INFO L168 Benchmark]: TraceAbstraction took 17008.82 ms. Allocated memory was 202.9 MB in the beginning and 873.5 MB in the end (delta: 670.6 MB). Free memory was 104.3 MB in the beginning and 257.9 MB in the end (delta: -153.6 MB). Peak memory consumption was 517.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:30:56,053 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.46 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.44 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 156.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.99 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.56 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.55 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 104.3 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17008.82 ms. Allocated memory was 202.9 MB in the beginning and 873.5 MB in the end (delta: 670.6 MB). Free memory was 104.3 MB in the beginning and 257.9 MB in the end (delta: -153.6 MB). Peak memory consumption was 517.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 164 ProgramPointsBefore, 84 ProgramPointsAfterwards, 195 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4106 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48939 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1270 SDtfs, 1232 SDslu, 2750 SDs, 0 SdLazy, 2167 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24300occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 3238 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 88561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...