/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/mix051_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:43:45,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:43:45,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:43:45,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:43:45,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:43:45,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:43:45,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:43:45,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:43:45,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:43:45,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:43:45,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:43:45,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:43:45,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:43:45,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:43:45,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:43:45,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:43:45,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:43:45,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:43:45,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:43:45,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:43:45,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:43:45,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:43:45,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:43:45,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:43:45,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:43:45,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:43:45,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:43:45,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:43:45,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:43:45,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:43:45,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:43:45,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:43:45,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:43:45,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:43:45,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:43:45,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:43:45,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:43:45,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:43:45,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:43:45,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:43:45,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:43:45,969 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:43:45,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:43:45,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:43:45,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:43:45,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:43:45,999 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:43:45,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:43:46,000 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:43:46,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:43:46,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:43:46,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:43:46,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:43:46,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:43:46,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:43:46,001 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:43:46,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:43:46,001 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:43:46,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:43:46,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:43:46,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:43:46,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:43:46,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:43:46,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:43:46,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:43:46,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:43:46,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:43:46,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:43:46,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:43:46,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:43:46,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:43:46,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:43:46,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:43:46,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:43:46,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:43:46,298 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:43:46,298 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:43:46,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2019-12-18 21:43:46,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445b63742/30a71c2e3c6742c89714c4689559bbee/FLAGe9a6de68f [2019-12-18 21:43:46,992 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:43:46,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2019-12-18 21:43:47,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445b63742/30a71c2e3c6742c89714c4689559bbee/FLAGe9a6de68f [2019-12-18 21:43:47,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445b63742/30a71c2e3c6742c89714c4689559bbee [2019-12-18 21:43:47,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:43:47,237 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:43:47,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:43:47,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:43:47,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:43:47,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:43:47" (1/1) ... [2019-12-18 21:43:47,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1570dfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:47, skipping insertion in model container [2019-12-18 21:43:47,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:43:47" (1/1) ... [2019-12-18 21:43:47,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:43:47,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:43:47,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:43:47,869 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:43:47,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:43:48,002 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:43:48,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48 WrapperNode [2019-12-18 21:43:48,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:43:48,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:43:48,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:43:48,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:43:48,012 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:43:48" (1/1) ... [2019-12-18 21:43:48,032 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:43:48" (1/1) ... [2019-12-18 21:43:48,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:43:48,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:43:48,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:43:48,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:43:48,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48" (1/1) ... [2019-12-18 21:43:48,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48" (1/1) ... [2019-12-18 21:43:48,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48" (1/1) ... [2019-12-18 21:43:48,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48" (1/1) ... [2019-12-18 21:43:48,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48" (1/1) ... [2019-12-18 21:43:48,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48" (1/1) ... [2019-12-18 21:43:48,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48" (1/1) ... [2019-12-18 21:43:48,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:43:48,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:43:48,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:43:48,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:43:48,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48" (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:43:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:43:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:43:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:43:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:43:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:43:48,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:43:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:43:48,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:43:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:43:48,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:43:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:43:48,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:43:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:43:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:43:48,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:43:48,182 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:43:48,851 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:43:48,851 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:43:48,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:43:48 BoogieIcfgContainer [2019-12-18 21:43:48,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:43:48,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:43:48,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:43:48,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:43:48,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:43:47" (1/3) ... [2019-12-18 21:43:48,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7a6b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:43:48, skipping insertion in model container [2019-12-18 21:43:48,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:43:48" (2/3) ... [2019-12-18 21:43:48,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7a6b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:43:48, skipping insertion in model container [2019-12-18 21:43:48,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:43:48" (3/3) ... [2019-12-18 21:43:48,862 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt.i [2019-12-18 21:43:48,872 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:43:48,872 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:43:48,883 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:43:48,884 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:43:48,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,932 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,932 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,961 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,961 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,961 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,978 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,979 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,988 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,990 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,997 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,997 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:48,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:49,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:49,000 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:49,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:49,002 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:49,002 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:49,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:43:49,016 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:43:49,032 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:43:49,032 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:43:49,032 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:43:49,032 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:43:49,032 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:43:49,032 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:43:49,032 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:43:49,033 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:43:49,049 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-18 21:43:49,051 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-18 21:43:49,132 INFO L126 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-18 21:43:49,132 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:43:49,148 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/161 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:43:49,169 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-18 21:43:49,216 INFO L126 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-18 21:43:49,216 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:43:49,223 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/161 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:43:49,239 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 21:43:49,240 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:43:52,880 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 21:43:53,044 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 21:43:53,063 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49357 [2019-12-18 21:43:53,063 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 21:43:53,067 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 85 transitions [2019-12-18 21:43:54,751 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26346 states. [2019-12-18 21:43:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 26346 states. [2019-12-18 21:43:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:43:54,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:43:54,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:43:54,762 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:43:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:43:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash -759634439, now seen corresponding path program 1 times [2019-12-18 21:43:54,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:43:54,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050894395] [2019-12-18 21:43:54,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:43:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:43:55,064 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:43:55,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050894395] [2019-12-18 21:43:55,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:43:55,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:43:55,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108929586] [2019-12-18 21:43:55,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:43:55,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:43:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:43:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:43:55,107 INFO L87 Difference]: Start difference. First operand 26346 states. Second operand 3 states. [2019-12-18 21:43:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:43:56,408 INFO L93 Difference]: Finished difference Result 25258 states and 110048 transitions. [2019-12-18 21:43:56,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:43:56,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:43:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:43:56,695 INFO L225 Difference]: With dead ends: 25258 [2019-12-18 21:43:56,695 INFO L226 Difference]: Without dead ends: 23750 [2019-12-18 21:43:56,697 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:43:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23750 states. [2019-12-18 21:43:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23750 to 23750. [2019-12-18 21:43:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23750 states. [2019-12-18 21:43:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23750 states to 23750 states and 103328 transitions. [2019-12-18 21:43:59,079 INFO L78 Accepts]: Start accepts. Automaton has 23750 states and 103328 transitions. Word has length 9 [2019-12-18 21:43:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:43:59,080 INFO L462 AbstractCegarLoop]: Abstraction has 23750 states and 103328 transitions. [2019-12-18 21:43:59,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:43:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 23750 states and 103328 transitions. [2019-12-18 21:43:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:43:59,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:43:59,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:43:59,088 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:43:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:43:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1799856256, now seen corresponding path program 1 times [2019-12-18 21:43:59,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:43:59,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419406660] [2019-12-18 21:43:59,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:43:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:43:59,241 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:43:59,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419406660] [2019-12-18 21:43:59,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:43:59,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:43:59,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650178155] [2019-12-18 21:43:59,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:43:59,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:43:59,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:43:59,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:43:59,246 INFO L87 Difference]: Start difference. First operand 23750 states and 103328 transitions. Second operand 4 states. [2019-12-18 21:44:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:00,010 INFO L93 Difference]: Finished difference Result 35150 states and 147788 transitions. [2019-12-18 21:44:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:44:00,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:44:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:00,216 INFO L225 Difference]: With dead ends: 35150 [2019-12-18 21:44:00,216 INFO L226 Difference]: Without dead ends: 35098 [2019-12-18 21:44:00,218 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:44:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35098 states. [2019-12-18 21:44:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35098 to 31154. [2019-12-18 21:44:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31154 states. [2019-12-18 21:44:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31154 states to 31154 states and 133236 transitions. [2019-12-18 21:44:01,958 INFO L78 Accepts]: Start accepts. Automaton has 31154 states and 133236 transitions. Word has length 15 [2019-12-18 21:44:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:01,958 INFO L462 AbstractCegarLoop]: Abstraction has 31154 states and 133236 transitions. [2019-12-18 21:44:01,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:44:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 31154 states and 133236 transitions. [2019-12-18 21:44:01,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:44:01,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:01,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:44:01,967 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:01,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:01,967 INFO L82 PathProgramCache]: Analyzing trace with hash 323486730, now seen corresponding path program 1 times [2019-12-18 21:44:01,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:01,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607040527] [2019-12-18 21:44:01,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:02,017 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:44:02,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607040527] [2019-12-18 21:44:02,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:02,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:44:02,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720037547] [2019-12-18 21:44:02,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:44:02,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:44:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:44:02,020 INFO L87 Difference]: Start difference. First operand 31154 states and 133236 transitions. Second operand 3 states. [2019-12-18 21:44:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:02,680 INFO L93 Difference]: Finished difference Result 41786 states and 175188 transitions. [2019-12-18 21:44:02,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:44:02,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 21:44:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:02,983 INFO L225 Difference]: With dead ends: 41786 [2019-12-18 21:44:02,983 INFO L226 Difference]: Without dead ends: 41786 [2019-12-18 21:44:02,984 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:44:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41786 states. [2019-12-18 21:44:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41786 to 33590. [2019-12-18 21:44:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33590 states. [2019-12-18 21:44:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33590 states to 33590 states and 143212 transitions. [2019-12-18 21:44:06,139 INFO L78 Accepts]: Start accepts. Automaton has 33590 states and 143212 transitions. Word has length 18 [2019-12-18 21:44:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:06,139 INFO L462 AbstractCegarLoop]: Abstraction has 33590 states and 143212 transitions. [2019-12-18 21:44:06,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:44:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 33590 states and 143212 transitions. [2019-12-18 21:44:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:44:06,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:06,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:44:06,151 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash 207003920, now seen corresponding path program 1 times [2019-12-18 21:44:06,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:06,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080437732] [2019-12-18 21:44:06,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:06,262 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:44:06,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080437732] [2019-12-18 21:44:06,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:06,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:44:06,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870755356] [2019-12-18 21:44:06,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:44:06,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:06,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:44:06,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:44:06,264 INFO L87 Difference]: Start difference. First operand 33590 states and 143212 transitions. Second operand 4 states. [2019-12-18 21:44:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:06,912 INFO L93 Difference]: Finished difference Result 40994 states and 171724 transitions. [2019-12-18 21:44:06,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:44:06,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:44:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:07,065 INFO L225 Difference]: With dead ends: 40994 [2019-12-18 21:44:07,066 INFO L226 Difference]: Without dead ends: 40954 [2019-12-18 21:44:07,066 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:44:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40954 states. [2019-12-18 21:44:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40954 to 35398. [2019-12-18 21:44:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35398 states. [2019-12-18 21:44:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35398 states to 35398 states and 150368 transitions. [2019-12-18 21:44:09,739 INFO L78 Accepts]: Start accepts. Automaton has 35398 states and 150368 transitions. Word has length 18 [2019-12-18 21:44:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:09,740 INFO L462 AbstractCegarLoop]: Abstraction has 35398 states and 150368 transitions. [2019-12-18 21:44:09,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:44:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35398 states and 150368 transitions. [2019-12-18 21:44:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:44:09,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:09,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:44:09,750 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:09,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1335251272, now seen corresponding path program 1 times [2019-12-18 21:44:09,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:09,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304391255] [2019-12-18 21:44:09,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:09,801 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:44:09,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304391255] [2019-12-18 21:44:09,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:09,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:44:09,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161086160] [2019-12-18 21:44:09,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:44:09,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:09,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:44:09,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:44:09,803 INFO L87 Difference]: Start difference. First operand 35398 states and 150368 transitions. Second operand 4 states. [2019-12-18 21:44:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:10,180 INFO L93 Difference]: Finished difference Result 43630 states and 183012 transitions. [2019-12-18 21:44:10,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:44:10,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:44:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:10,286 INFO L225 Difference]: With dead ends: 43630 [2019-12-18 21:44:10,286 INFO L226 Difference]: Without dead ends: 43578 [2019-12-18 21:44:10,286 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:44:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43578 states. [2019-12-18 21:44:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43578 to 35970. [2019-12-18 21:44:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35970 states. [2019-12-18 21:44:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35970 states to 35970 states and 152956 transitions. [2019-12-18 21:44:13,851 INFO L78 Accepts]: Start accepts. Automaton has 35970 states and 152956 transitions. Word has length 18 [2019-12-18 21:44:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:13,852 INFO L462 AbstractCegarLoop]: Abstraction has 35970 states and 152956 transitions. [2019-12-18 21:44:13,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:44:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 35970 states and 152956 transitions. [2019-12-18 21:44:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 21:44:13,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:13,862 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] [2019-12-18 21:44:13,862 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1864435566, now seen corresponding path program 1 times [2019-12-18 21:44:13,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:13,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378472004] [2019-12-18 21:44:13,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:13,915 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:44:13,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378472004] [2019-12-18 21:44:13,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:13,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:44:13,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304654465] [2019-12-18 21:44:13,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:44:13,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:13,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:44:13,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:44:13,917 INFO L87 Difference]: Start difference. First operand 35970 states and 152956 transitions. Second operand 3 states. [2019-12-18 21:44:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:14,099 INFO L93 Difference]: Finished difference Result 35266 states and 149241 transitions. [2019-12-18 21:44:14,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:44:14,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 21:44:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:14,188 INFO L225 Difference]: With dead ends: 35266 [2019-12-18 21:44:14,188 INFO L226 Difference]: Without dead ends: 35266 [2019-12-18 21:44:14,188 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:44:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35266 states. [2019-12-18 21:44:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35266 to 35266. [2019-12-18 21:44:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35266 states. [2019-12-18 21:44:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35266 states to 35266 states and 149241 transitions. [2019-12-18 21:44:15,253 INFO L78 Accepts]: Start accepts. Automaton has 35266 states and 149241 transitions. Word has length 20 [2019-12-18 21:44:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:15,253 INFO L462 AbstractCegarLoop]: Abstraction has 35266 states and 149241 transitions. [2019-12-18 21:44:15,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:44:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 35266 states and 149241 transitions. [2019-12-18 21:44:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:44:15,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:15,269 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] [2019-12-18 21:44:15,269 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:15,269 INFO L82 PathProgramCache]: Analyzing trace with hash -583435641, now seen corresponding path program 1 times [2019-12-18 21:44:15,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:15,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988446814] [2019-12-18 21:44:15,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:15,322 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:44:15,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988446814] [2019-12-18 21:44:15,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:15,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:44:15,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124918878] [2019-12-18 21:44:15,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:44:15,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:15,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:44:15,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:44:15,325 INFO L87 Difference]: Start difference. First operand 35266 states and 149241 transitions. Second operand 3 states. [2019-12-18 21:44:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:15,569 INFO L93 Difference]: Finished difference Result 43553 states and 174772 transitions. [2019-12-18 21:44:15,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:44:15,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 21:44:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:15,658 INFO L225 Difference]: With dead ends: 43553 [2019-12-18 21:44:15,658 INFO L226 Difference]: Without dead ends: 35790 [2019-12-18 21:44:15,659 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:44:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35790 states. [2019-12-18 21:44:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35790 to 35042. [2019-12-18 21:44:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35042 states. [2019-12-18 21:44:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35042 states to 35042 states and 139616 transitions. [2019-12-18 21:44:16,803 INFO L78 Accepts]: Start accepts. Automaton has 35042 states and 139616 transitions. Word has length 21 [2019-12-18 21:44:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:16,803 INFO L462 AbstractCegarLoop]: Abstraction has 35042 states and 139616 transitions. [2019-12-18 21:44:16,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:44:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 35042 states and 139616 transitions. [2019-12-18 21:44:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:44:16,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:16,817 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] [2019-12-18 21:44:16,817 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash -359146426, now seen corresponding path program 1 times [2019-12-18 21:44:16,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:16,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412076157] [2019-12-18 21:44:16,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:16,889 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:44:16,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412076157] [2019-12-18 21:44:16,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:16,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:44:16,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203715726] [2019-12-18 21:44:16,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:44:16,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:16,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:44:16,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:44:16,891 INFO L87 Difference]: Start difference. First operand 35042 states and 139616 transitions. Second operand 5 states. [2019-12-18 21:44:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:17,003 INFO L93 Difference]: Finished difference Result 15598 states and 51058 transitions. [2019-12-18 21:44:17,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:44:17,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 21:44:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:17,024 INFO L225 Difference]: With dead ends: 15598 [2019-12-18 21:44:17,025 INFO L226 Difference]: Without dead ends: 13159 [2019-12-18 21:44:17,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:44:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13159 states. [2019-12-18 21:44:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13159 to 13159. [2019-12-18 21:44:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2019-12-18 21:44:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 42157 transitions. [2019-12-18 21:44:17,228 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 42157 transitions. Word has length 21 [2019-12-18 21:44:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:17,228 INFO L462 AbstractCegarLoop]: Abstraction has 13159 states and 42157 transitions. [2019-12-18 21:44:17,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:44:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 42157 transitions. [2019-12-18 21:44:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:44:17,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:17,233 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] [2019-12-18 21:44:17,233 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 697145585, now seen corresponding path program 1 times [2019-12-18 21:44:17,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:17,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972774175] [2019-12-18 21:44:17,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:17,325 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:44:17,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972774175] [2019-12-18 21:44:17,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:17,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:44:17,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257037065] [2019-12-18 21:44:17,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:44:17,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:17,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:44:17,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:44:17,328 INFO L87 Difference]: Start difference. First operand 13159 states and 42157 transitions. Second operand 6 states. [2019-12-18 21:44:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:17,444 INFO L93 Difference]: Finished difference Result 4507 states and 12985 transitions. [2019-12-18 21:44:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:44:17,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:44:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:17,452 INFO L225 Difference]: With dead ends: 4507 [2019-12-18 21:44:17,452 INFO L226 Difference]: Without dead ends: 3685 [2019-12-18 21:44:17,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:44:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2019-12-18 21:44:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3645. [2019-12-18 21:44:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3645 states. [2019-12-18 21:44:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 10431 transitions. [2019-12-18 21:44:17,514 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 10431 transitions. Word has length 22 [2019-12-18 21:44:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:17,515 INFO L462 AbstractCegarLoop]: Abstraction has 3645 states and 10431 transitions. [2019-12-18 21:44:17,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:44:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 10431 transitions. [2019-12-18 21:44:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:44:17,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:17,520 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] [2019-12-18 21:44:17,520 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:17,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1399010725, now seen corresponding path program 1 times [2019-12-18 21:44:17,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:17,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731264475] [2019-12-18 21:44:17,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:17,599 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:44:17,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731264475] [2019-12-18 21:44:17,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:17,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:44:17,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685066221] [2019-12-18 21:44:17,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:44:17,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:17,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:44:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:44:17,601 INFO L87 Difference]: Start difference. First operand 3645 states and 10431 transitions. Second operand 5 states. [2019-12-18 21:44:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:17,821 INFO L93 Difference]: Finished difference Result 4672 states and 12974 transitions. [2019-12-18 21:44:17,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:44:17,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-18 21:44:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:17,830 INFO L225 Difference]: With dead ends: 4672 [2019-12-18 21:44:17,830 INFO L226 Difference]: Without dead ends: 4606 [2019-12-18 21:44:17,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:44:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2019-12-18 21:44:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 3847. [2019-12-18 21:44:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-12-18 21:44:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 10974 transitions. [2019-12-18 21:44:17,899 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 10974 transitions. Word has length 32 [2019-12-18 21:44:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:17,900 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 10974 transitions. [2019-12-18 21:44:17,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:44:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 10974 transitions. [2019-12-18 21:44:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:44:17,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:17,907 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] [2019-12-18 21:44:17,907 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1249765011, now seen corresponding path program 1 times [2019-12-18 21:44:17,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:17,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693262297] [2019-12-18 21:44:17,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:17,945 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:44:17,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693262297] [2019-12-18 21:44:17,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:17,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:44:17,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858248148] [2019-12-18 21:44:17,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:44:17,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:44:17,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:44:17,947 INFO L87 Difference]: Start difference. First operand 3847 states and 10974 transitions. Second operand 3 states. [2019-12-18 21:44:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:18,003 INFO L93 Difference]: Finished difference Result 4763 states and 12963 transitions. [2019-12-18 21:44:18,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:44:18,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 21:44:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:18,011 INFO L225 Difference]: With dead ends: 4763 [2019-12-18 21:44:18,012 INFO L226 Difference]: Without dead ends: 4763 [2019-12-18 21:44:18,012 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:44:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2019-12-18 21:44:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 3805. [2019-12-18 21:44:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3805 states. [2019-12-18 21:44:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 10436 transitions. [2019-12-18 21:44:18,078 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 10436 transitions. Word has length 32 [2019-12-18 21:44:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:18,079 INFO L462 AbstractCegarLoop]: Abstraction has 3805 states and 10436 transitions. [2019-12-18 21:44:18,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:44:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 10436 transitions. [2019-12-18 21:44:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:44:18,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:18,085 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] [2019-12-18 21:44:18,085 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2123582447, now seen corresponding path program 1 times [2019-12-18 21:44:18,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:18,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412045284] [2019-12-18 21:44:18,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:18,224 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:44:18,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412045284] [2019-12-18 21:44:18,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:18,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:44:18,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844802688] [2019-12-18 21:44:18,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:44:18,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:44:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:44:18,227 INFO L87 Difference]: Start difference. First operand 3805 states and 10436 transitions. Second operand 4 states. [2019-12-18 21:44:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:18,263 INFO L93 Difference]: Finished difference Result 5668 states and 15168 transitions. [2019-12-18 21:44:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:44:18,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-18 21:44:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:18,272 INFO L225 Difference]: With dead ends: 5668 [2019-12-18 21:44:18,272 INFO L226 Difference]: Without dead ends: 3827 [2019-12-18 21:44:18,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:44:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2019-12-18 21:44:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3793. [2019-12-18 21:44:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3793 states. [2019-12-18 21:44:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3793 states and 10248 transitions. [2019-12-18 21:44:18,335 INFO L78 Accepts]: Start accepts. Automaton has 3793 states and 10248 transitions. Word has length 32 [2019-12-18 21:44:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:18,335 INFO L462 AbstractCegarLoop]: Abstraction has 3793 states and 10248 transitions. [2019-12-18 21:44:18,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:44:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 10248 transitions. [2019-12-18 21:44:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:44:18,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:18,343 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] [2019-12-18 21:44:18,343 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:18,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:18,343 INFO L82 PathProgramCache]: Analyzing trace with hash -508061947, now seen corresponding path program 2 times [2019-12-18 21:44:18,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:18,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844256179] [2019-12-18 21:44:18,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:18,481 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:44:18,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844256179] [2019-12-18 21:44:18,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:18,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:44:18,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791579259] [2019-12-18 21:44:18,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:44:18,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:18,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:44:18,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:44:18,484 INFO L87 Difference]: Start difference. First operand 3793 states and 10248 transitions. Second operand 5 states. [2019-12-18 21:44:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:18,920 INFO L93 Difference]: Finished difference Result 5598 states and 15025 transitions. [2019-12-18 21:44:18,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:44:18,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-18 21:44:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:18,929 INFO L225 Difference]: With dead ends: 5598 [2019-12-18 21:44:18,929 INFO L226 Difference]: Without dead ends: 5598 [2019-12-18 21:44:18,930 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:44:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2019-12-18 21:44:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 4807. [2019-12-18 21:44:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4807 states. [2019-12-18 21:44:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 13100 transitions. [2019-12-18 21:44:18,991 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 13100 transitions. Word has length 32 [2019-12-18 21:44:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:18,992 INFO L462 AbstractCegarLoop]: Abstraction has 4807 states and 13100 transitions. [2019-12-18 21:44:18,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:44:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 13100 transitions. [2019-12-18 21:44:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:44:18,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:18,998 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] [2019-12-18 21:44:18,998 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash 902021539, now seen corresponding path program 1 times [2019-12-18 21:44:18,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:18,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771711251] [2019-12-18 21:44:18,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:19,076 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:44:19,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771711251] [2019-12-18 21:44:19,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:19,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:44:19,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606842854] [2019-12-18 21:44:19,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:44:19,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:19,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:44:19,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:44:19,078 INFO L87 Difference]: Start difference. First operand 4807 states and 13100 transitions. Second operand 5 states. [2019-12-18 21:44:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:19,302 INFO L93 Difference]: Finished difference Result 5593 states and 14994 transitions. [2019-12-18 21:44:19,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:44:19,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 21:44:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:19,312 INFO L225 Difference]: With dead ends: 5593 [2019-12-18 21:44:19,312 INFO L226 Difference]: Without dead ends: 5510 [2019-12-18 21:44:19,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:44:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2019-12-18 21:44:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 4607. [2019-12-18 21:44:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2019-12-18 21:44:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 12605 transitions. [2019-12-18 21:44:19,396 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 12605 transitions. Word has length 33 [2019-12-18 21:44:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:19,397 INFO L462 AbstractCegarLoop]: Abstraction has 4607 states and 12605 transitions. [2019-12-18 21:44:19,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:44:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 12605 transitions. [2019-12-18 21:44:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:44:19,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:19,408 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] [2019-12-18 21:44:19,408 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash -547913919, now seen corresponding path program 1 times [2019-12-18 21:44:19,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:19,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101819003] [2019-12-18 21:44:19,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:19,530 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:44:19,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101819003] [2019-12-18 21:44:19,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:19,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:44:19,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583348280] [2019-12-18 21:44:19,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:44:19,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:44:19,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:44:19,532 INFO L87 Difference]: Start difference. First operand 4607 states and 12605 transitions. Second operand 7 states. [2019-12-18 21:44:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:19,663 INFO L93 Difference]: Finished difference Result 3755 states and 10518 transitions. [2019-12-18 21:44:19,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:44:19,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:44:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:19,669 INFO L225 Difference]: With dead ends: 3755 [2019-12-18 21:44:19,669 INFO L226 Difference]: Without dead ends: 2551 [2019-12-18 21:44:19,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:44:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-12-18 21:44:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2185. [2019-12-18 21:44:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2019-12-18 21:44:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 5946 transitions. [2019-12-18 21:44:19,715 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 5946 transitions. Word has length 33 [2019-12-18 21:44:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:19,716 INFO L462 AbstractCegarLoop]: Abstraction has 2185 states and 5946 transitions. [2019-12-18 21:44:19,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:44:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 5946 transitions. [2019-12-18 21:44:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:44:19,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:19,721 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] [2019-12-18 21:44:19,721 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash -761511395, now seen corresponding path program 1 times [2019-12-18 21:44:19,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:19,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735909066] [2019-12-18 21:44:19,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:19,810 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:44:19,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735909066] [2019-12-18 21:44:19,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:19,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:44:19,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562276445] [2019-12-18 21:44:19,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:44:19,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:19,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:44:19,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:44:19,812 INFO L87 Difference]: Start difference. First operand 2185 states and 5946 transitions. Second operand 4 states. [2019-12-18 21:44:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:19,840 INFO L93 Difference]: Finished difference Result 2809 states and 7264 transitions. [2019-12-18 21:44:19,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:44:19,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 21:44:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:19,842 INFO L225 Difference]: With dead ends: 2809 [2019-12-18 21:44:19,842 INFO L226 Difference]: Without dead ends: 696 [2019-12-18 21:44:19,842 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:44:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-12-18 21:44:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2019-12-18 21:44:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-12-18 21:44:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1448 transitions. [2019-12-18 21:44:19,852 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1448 transitions. Word has length 47 [2019-12-18 21:44:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:19,852 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1448 transitions. [2019-12-18 21:44:19,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:44:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1448 transitions. [2019-12-18 21:44:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:44:19,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:19,854 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] [2019-12-18 21:44:19,855 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:19,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash 309797789, now seen corresponding path program 2 times [2019-12-18 21:44:19,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:19,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864094290] [2019-12-18 21:44:19,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:19,938 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:44:19,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864094290] [2019-12-18 21:44:19,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:19,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:44:19,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972412306] [2019-12-18 21:44:19,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:44:19,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:19,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:44:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:44:19,941 INFO L87 Difference]: Start difference. First operand 696 states and 1448 transitions. Second operand 7 states. [2019-12-18 21:44:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:20,112 INFO L93 Difference]: Finished difference Result 1132 states and 2298 transitions. [2019-12-18 21:44:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:44:20,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 21:44:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:20,113 INFO L225 Difference]: With dead ends: 1132 [2019-12-18 21:44:20,113 INFO L226 Difference]: Without dead ends: 737 [2019-12-18 21:44:20,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:44:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-18 21:44:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 693. [2019-12-18 21:44:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-12-18 21:44:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1419 transitions. [2019-12-18 21:44:20,124 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1419 transitions. Word has length 47 [2019-12-18 21:44:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:20,124 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 1419 transitions. [2019-12-18 21:44:20,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:44:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1419 transitions. [2019-12-18 21:44:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:44:20,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:20,126 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] [2019-12-18 21:44:20,126 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash -355324541, now seen corresponding path program 3 times [2019-12-18 21:44:20,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:20,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35266069] [2019-12-18 21:44:20,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:44:20,189 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:44:20,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35266069] [2019-12-18 21:44:20,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:44:20,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:44:20,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883002451] [2019-12-18 21:44:20,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:44:20,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:44:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:44:20,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:44:20,192 INFO L87 Difference]: Start difference. First operand 693 states and 1419 transitions. Second operand 3 states. [2019-12-18 21:44:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:44:20,205 INFO L93 Difference]: Finished difference Result 691 states and 1414 transitions. [2019-12-18 21:44:20,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:44:20,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 21:44:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:44:20,207 INFO L225 Difference]: With dead ends: 691 [2019-12-18 21:44:20,207 INFO L226 Difference]: Without dead ends: 691 [2019-12-18 21:44:20,207 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:44:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-12-18 21:44:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 576. [2019-12-18 21:44:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 21:44:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1194 transitions. [2019-12-18 21:44:20,217 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1194 transitions. Word has length 47 [2019-12-18 21:44:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:44:20,218 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1194 transitions. [2019-12-18 21:44:20,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:44:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1194 transitions. [2019-12-18 21:44:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:44:20,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:44:20,219 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] [2019-12-18 21:44:20,219 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:44:20,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:44:20,220 INFO L82 PathProgramCache]: Analyzing trace with hash -108021629, now seen corresponding path program 1 times [2019-12-18 21:44:20,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:44:20,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784459514] [2019-12-18 21:44:20,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:44:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:44:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:44:20,411 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:44:20,411 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:44:20,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_77| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~z$r_buff1_thd1~0_11) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1365~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1365~0.base_25|) |v_ULTIMATE.start_main_~#t1365~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~z$r_buff1_thd2~0_11) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$r_buff0_thd2~0_10 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd4~0_21) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_25|)) (= 0 |v_ULTIMATE.start_main_~#t1365~0.offset_18|) (= 0 v_~__unbuffered_p3_EAX~0_16) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff0_thd4~0_28 0) (= v_~z$r_buff0_thd3~0_70 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$r_buff1_thd0~0_22) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$mem_tmp~0_10 0) (= v_~z$w_buff0_used~0_95 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1365~0.base_25| 4)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1365~0.base_25|) (= v_~a~0_12 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z~0_20 0) (= v_~y~0_11 0) (= 0 v_~z$w_buff1~0_24) (= v_~x~0_19 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1365~0.base_25| 1) |v_#valid_75|) (= 0 v_~z$w_buff1_used~0_57))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_19|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_26|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ULTIMATE.start_main_~#t1365~0.offset=|v_ULTIMATE.start_main_~#t1365~0.offset_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t1365~0.base=|v_ULTIMATE.start_main_~#t1365~0.base_25|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_19|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_18|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_26|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_21|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_~#t1366~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1365~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1365~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1366~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1368~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1367~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1368~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:44:20,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1366~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) |v_ULTIMATE.start_main_~#t1366~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1366~0.base_11| 4) |v_#length_21|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1366~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1366~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1366~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, ULTIMATE.start_main_~#t1366~0.base=|v_ULTIMATE.start_main_~#t1366~0.base_11|, ULTIMATE.start_main_~#t1366~0.offset=|v_ULTIMATE.start_main_~#t1366~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1366~0.base, ULTIMATE.start_main_~#t1366~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 21:44:20,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1367~0.offset_10| 0) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t1367~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1367~0.base_11|) |v_ULTIMATE.start_main_~#t1367~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1367~0.base_11|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1367~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1367~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1367~0.offset=|v_ULTIMATE.start_main_~#t1367~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1367~0.base=|v_ULTIMATE.start_main_~#t1367~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1367~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1367~0.base] because there is no mapped edge [2019-12-18 21:44:20,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-1-->L839: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1368~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1368~0.base_13|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1368~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1368~0.base_13|) |v_ULTIMATE.start_main_~#t1368~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1368~0.base_13| 4) |v_#length_23|) (not (= |v_ULTIMATE.start_main_~#t1368~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1368~0.base=|v_ULTIMATE.start_main_~#t1368~0.base_13|, ULTIMATE.start_main_~#t1368~0.offset=|v_ULTIMATE.start_main_~#t1368~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1368~0.base, ULTIMATE.start_main_~#t1368~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 21:44:20,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_5) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd4~0_18 v_~z$r_buff1_thd4~0_11) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_5) (= v_~z$r_buff0_thd3~0_45 v_~z$r_buff1_thd3~0_27) (= v_~__unbuffered_p3_EAX~0_5 v_~a~0_7) (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd4~0_17 1)) InVars {~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_5} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_5} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 21:44:20,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_~x~0_10 1) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= 1 v_~a~0_8) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{~a~0=v_~a~0_8, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_10, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 21:44:20,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 2 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~__unbuffered_p1_EAX~0_5 v_~y~0_6) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_6} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_6, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 21:44:20,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2114626093 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-2114626093 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork1_#t~ite28_Out-2114626093|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2114626093 |P3Thread1of1ForFork1_#t~ite28_Out-2114626093|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114626093, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2114626093} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2114626093, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-2114626093|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2114626093} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:44:20,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In325555702 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In325555702 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In325555702 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In325555702 256) 0))) (or (and (= ~z$w_buff1_used~0_In325555702 |P3Thread1of1ForFork1_#t~ite29_Out325555702|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out325555702|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In325555702, ~z$w_buff0_used~0=~z$w_buff0_used~0_In325555702, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In325555702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In325555702} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In325555702, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out325555702|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In325555702, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In325555702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In325555702} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 21:44:20,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1169492728 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1169492728 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-1169492728 0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out-1169492728 ~z$r_buff0_thd4~0_In-1169492728) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1169492728, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1169492728} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1169492728, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1169492728, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1169492728|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 21:44:20,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1692286449 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1692286449 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1692286449 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1692286449 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out-1692286449|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd4~0_In-1692286449 |P3Thread1of1ForFork1_#t~ite31_Out-1692286449|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1692286449, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1692286449, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1692286449, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1692286449} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1692286449, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1692286449, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1692286449, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1692286449, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-1692286449|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:44:20,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L814-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~z$r_buff1_thd4~0_16 |v_P3Thread1of1ForFork1_#t~ite31_8|) (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_8|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:44:20,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L778-->L779: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd3~0_61 v_~z$r_buff0_thd3~0_60)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_10|, ~weak$$choice2~0=v_~weak$$choice2~0_27, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 21:44:20,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse5 (= (mod ~z$r_buff1_thd3~0_In-1594672072 256) 0)) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In-1594672072 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1594672072 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd3~0_In-1594672072 256) 0)) (.cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-1594672072| |P2Thread1of1ForFork0_#t~ite23_Out-1594672072|)) (.cse1 (= (mod ~weak$$choice2~0_In-1594672072 256) 0))) (or (let ((.cse2 (not .cse6))) (and (= 0 |P2Thread1of1ForFork0_#t~ite22_Out-1594672072|) .cse0 .cse1 (= |P2Thread1of1ForFork0_#t~ite23_Out-1594672072| |P2Thread1of1ForFork0_#t~ite22_Out-1594672072|) (or .cse2 (not .cse3)) (not .cse4) (or .cse2 (not .cse5)))) (and (= |P2Thread1of1ForFork0_#t~ite22_In-1594672072| |P2Thread1of1ForFork0_#t~ite22_Out-1594672072|) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In-1594672072| |P2Thread1of1ForFork0_#t~ite23_Out-1594672072|) (not .cse1) (= ~z$r_buff1_thd3~0_In-1594672072 |P2Thread1of1ForFork0_#t~ite24_Out-1594672072|)) (and (= ~z$r_buff1_thd3~0_In-1594672072 |P2Thread1of1ForFork0_#t~ite23_Out-1594672072|) (or (and .cse5 .cse6) .cse4 (and .cse3 .cse6)) .cse0 .cse1))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1594672072, P2Thread1of1ForFork0_#t~ite22=|P2Thread1of1ForFork0_#t~ite22_In-1594672072|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1594672072, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1594672072|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1594672072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1594672072, ~weak$$choice2~0=~weak$$choice2~0_In-1594672072} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1594672072, P2Thread1of1ForFork0_#t~ite22=|P2Thread1of1ForFork0_#t~ite22_Out-1594672072|, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1594672072|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1594672072, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1594672072|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1594672072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1594672072, ~weak$$choice2~0=~weak$$choice2~0_In-1594672072} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 21:44:20,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_14 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:44:20,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_65 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:44:20,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-174832626 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-174832626 256)))) (or (and (= ~z~0_In-174832626 |ULTIMATE.start_main_#t~ite36_Out-174832626|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-174832626 |ULTIMATE.start_main_#t~ite36_Out-174832626|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-174832626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-174832626, ~z$w_buff1~0=~z$w_buff1~0_In-174832626, ~z~0=~z~0_In-174832626} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-174832626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-174832626, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-174832626|, ~z$w_buff1~0=~z$w_buff1~0_In-174832626, ~z~0=~z~0_In-174832626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:44:20,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-18 21:44:20,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-979085919 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-979085919 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-979085919| ~z$w_buff0_used~0_In-979085919) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-979085919| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-979085919, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-979085919} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-979085919, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-979085919, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-979085919|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:44:20,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In871349837 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In871349837 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In871349837 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In871349837 256) 0))) (or (and (= ~z$w_buff1_used~0_In871349837 |ULTIMATE.start_main_#t~ite39_Out871349837|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out871349837|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In871349837, ~z$w_buff0_used~0=~z$w_buff0_used~0_In871349837, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In871349837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In871349837} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In871349837, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out871349837|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In871349837, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In871349837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In871349837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:44:20,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2133030858 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2133030858 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out-2133030858|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-2133030858 |ULTIMATE.start_main_#t~ite40_Out-2133030858|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2133030858, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133030858} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2133030858, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2133030858|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133030858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:44:20,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1767369881 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1767369881 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1767369881 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1767369881 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1767369881| ~z$r_buff1_thd0~0_In-1767369881) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out-1767369881| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1767369881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1767369881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1767369881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1767369881} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1767369881|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1767369881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1767369881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1767369881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1767369881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 21:44:20,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite41_14| v_~z$r_buff1_thd0~0_15) (= v_~x~0_14 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= v_~main$tmp_guard1~0_11 0)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_14} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:44:20,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:44:20 BasicIcfg [2019-12-18 21:44:20,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:44:20,547 INFO L168 Benchmark]: Toolchain (without parser) took 33310.77 ms. Allocated memory was 145.8 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 101.6 MB in the beginning and 863.9 MB in the end (delta: -762.3 MB). Peak memory consumption was 968.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:44:20,548 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 21:44:20,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.90 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 157.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:44:20,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.86 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 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:44:20,550 INFO L168 Benchmark]: Boogie Preprocessor took 43.35 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 151.9 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:44:20,550 INFO L168 Benchmark]: RCFGBuilder took 740.01 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 106.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:44:20,551 INFO L168 Benchmark]: TraceAbstraction took 31691.14 ms. Allocated memory was 203.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 105.8 MB in the beginning and 863.9 MB in the end (delta: -758.1 MB). Peak memory consumption was 915.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:44:20,554 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.90 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 157.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.86 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.35 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 740.01 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 106.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31691.14 ms. Allocated memory was 203.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 105.8 MB in the beginning and 863.9 MB in the end (delta: -758.1 MB). Peak memory consumption was 915.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 168 ProgramPointsBefore, 78 ProgramPointsAfterwards, 190 TransitionsBefore, 85 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 20 ChoiceCompositions, 5376 VarBasedMoverChecksPositive, 128 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49357 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 31.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2075 SDtfs, 2481 SDslu, 3176 SDs, 0 SdLazy, 1257 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35970occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 30062 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 40627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...