/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:34:54,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:34:54,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:34:54,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:34:54,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:34:54,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:34:54,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:34:54,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:34:54,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:34:54,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:34:54,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:34:54,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:34:54,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:34:54,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:34:54,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:34:54,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:34:54,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:34:54,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:34:54,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:34:54,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:34:54,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:34:54,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:34:54,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:34:54,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:34:54,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:34:54,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:34:54,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:34:54,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:34:54,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:34:54,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:34:54,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:34:54,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:34:54,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:34:54,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:34:54,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:34:54,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:34:54,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:34:54,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:34:54,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:34:54,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:34:54,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:34:54,946 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-MCR.epf [2019-12-27 19:34:54,960 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:34:54,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:34:54,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:34:54,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:34:54,962 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:34:54,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:34:54,963 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:34:54,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:34:54,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:34:54,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:34:54,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:34:54,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:34:54,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:34:54,964 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:34:54,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:34:54,964 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:34:54,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:34:54,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:34:54,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:34:54,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:34:54,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:34:54,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:34:54,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:34:54,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:34:54,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:34:54,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:34:54,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:34:54,967 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:34:54,967 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:34:54,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:34:54,967 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:34:54,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:34:55,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:34:55,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:34:55,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:34:55,288 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:34:55,289 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:34:55,290 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i [2019-12-27 19:34:55,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3dffa3c/fa0e602e543246fea9ffc42ab936e98b/FLAGdc8cdae6e [2019-12-27 19:34:55,908 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:34:55,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i [2019-12-27 19:34:55,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3dffa3c/fa0e602e543246fea9ffc42ab936e98b/FLAGdc8cdae6e [2019-12-27 19:34:56,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3dffa3c/fa0e602e543246fea9ffc42ab936e98b [2019-12-27 19:34:56,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:34:56,196 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:34:56,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:34:56,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:34:56,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:34:56,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:34:56" (1/1) ... [2019-12-27 19:34:56,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de52564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:56, skipping insertion in model container [2019-12-27 19:34:56,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:34:56" (1/1) ... [2019-12-27 19:34:56,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:34:56,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:34:56,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:34:56,833 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:34:56,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:34:57,005 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:34:57,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57 WrapperNode [2019-12-27 19:34:57,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:34:57,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:34:57,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:34:57,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:34:57,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (1/1) ... [2019-12-27 19:34:57,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (1/1) ... [2019-12-27 19:34:57,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:34:57,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:34:57,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:34:57,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:34:57,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (1/1) ... [2019-12-27 19:34:57,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (1/1) ... [2019-12-27 19:34:57,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (1/1) ... [2019-12-27 19:34:57,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (1/1) ... [2019-12-27 19:34:57,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (1/1) ... [2019-12-27 19:34:57,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (1/1) ... [2019-12-27 19:34:57,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (1/1) ... [2019-12-27 19:34:57,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:34:57,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:34:57,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:34:57,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:34:57,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (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-27 19:34:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:34:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:34:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:34:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:34:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:34:57,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:34:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:34:57,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:34:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:34:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:34:57,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:34:57,208 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:34:58,104 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:34:58,105 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:34:58,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:34:58 BoogieIcfgContainer [2019-12-27 19:34:58,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:34:58,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:34:58,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:34:58,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:34:58,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:34:56" (1/3) ... [2019-12-27 19:34:58,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f54fca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:34:58, skipping insertion in model container [2019-12-27 19:34:58,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:34:57" (2/3) ... [2019-12-27 19:34:58,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f54fca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:34:58, skipping insertion in model container [2019-12-27 19:34:58,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:34:58" (3/3) ... [2019-12-27 19:34:58,131 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.oepc.i [2019-12-27 19:34:58,141 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:34:58,142 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:34:58,152 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:34:58,153 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:34:58,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,225 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,225 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,253 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,261 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,262 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:34:58,282 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 19:34:58,303 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:34:58,303 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:34:58,303 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:34:58,304 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:34:58,304 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:34:58,304 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:34:58,304 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:34:58,304 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:34:58,322 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-27 19:34:58,324 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 19:34:58,446 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 19:34:58,446 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:34:58,467 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 19:34:58,500 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 19:34:58,567 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 19:34:58,567 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:34:58,580 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 19:34:58,616 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-27 19:34:58,617 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:35:01,998 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 19:35:02,170 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 19:35:02,222 INFO L206 etLargeBlockEncoding]: Checked pairs total: 156567 [2019-12-27 19:35:02,223 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 19:35:02,226 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 141 transitions [2019-12-27 19:35:04,558 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 31650 states. [2019-12-27 19:35:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 31650 states. [2019-12-27 19:35:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:35:04,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:04,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:35:04,566 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:04,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1078912, now seen corresponding path program 1 times [2019-12-27 19:35:04,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:04,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503898070] [2019-12-27 19:35:04,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:04,821 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-27 19:35:04,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503898070] [2019-12-27 19:35:04,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:04,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:35:04,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520249592] [2019-12-27 19:35:04,827 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:04,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:04,845 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:35:04,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:04,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:04,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:04,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:04,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:04,870 INFO L87 Difference]: Start difference. First operand 31650 states. Second operand 3 states. [2019-12-27 19:35:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:06,076 INFO L93 Difference]: Finished difference Result 31498 states and 111612 transitions. [2019-12-27 19:35:06,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:06,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:35:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:06,352 INFO L225 Difference]: With dead ends: 31498 [2019-12-27 19:35:06,352 INFO L226 Difference]: Without dead ends: 29342 [2019-12-27 19:35:06,354 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-27 19:35:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29342 states. [2019-12-27 19:35:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29342 to 29342. [2019-12-27 19:35:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29342 states. [2019-12-27 19:35:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29342 states to 29342 states and 103886 transitions. [2019-12-27 19:35:08,271 INFO L78 Accepts]: Start accepts. Automaton has 29342 states and 103886 transitions. Word has length 3 [2019-12-27 19:35:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:08,272 INFO L462 AbstractCegarLoop]: Abstraction has 29342 states and 103886 transitions. [2019-12-27 19:35:08,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 29342 states and 103886 transitions. [2019-12-27 19:35:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:35:08,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:08,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:08,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash 559991540, now seen corresponding path program 1 times [2019-12-27 19:35:08,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:08,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042484689] [2019-12-27 19:35:08,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:08,349 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-27 19:35:08,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042484689] [2019-12-27 19:35:08,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:08,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:35:08,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [692258419] [2019-12-27 19:35:08,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:08,353 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:08,356 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:35:08,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:08,356 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:08,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:08,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:08,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:08,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:08,358 INFO L87 Difference]: Start difference. First operand 29342 states and 103886 transitions. Second operand 3 states. [2019-12-27 19:35:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:08,434 INFO L93 Difference]: Finished difference Result 3451 states and 8567 transitions. [2019-12-27 19:35:08,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:08,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 19:35:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:08,445 INFO L225 Difference]: With dead ends: 3451 [2019-12-27 19:35:08,445 INFO L226 Difference]: Without dead ends: 3451 [2019-12-27 19:35:08,447 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-27 19:35:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2019-12-27 19:35:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3451. [2019-12-27 19:35:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3451 states. [2019-12-27 19:35:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 8567 transitions. [2019-12-27 19:35:08,533 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 8567 transitions. Word has length 11 [2019-12-27 19:35:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:08,534 INFO L462 AbstractCegarLoop]: Abstraction has 3451 states and 8567 transitions. [2019-12-27 19:35:08,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 8567 transitions. [2019-12-27 19:35:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:35:08,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:08,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:08,542 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1482577634, now seen corresponding path program 1 times [2019-12-27 19:35:08,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:08,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542511327] [2019-12-27 19:35:08,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:08,696 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-27 19:35:08,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542511327] [2019-12-27 19:35:08,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:08,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:35:08,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1802875128] [2019-12-27 19:35:08,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:08,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:08,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 19:35:08,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:08,704 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:08,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:35:08,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:35:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:08,705 INFO L87 Difference]: Start difference. First operand 3451 states and 8567 transitions. Second operand 4 states. [2019-12-27 19:35:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:09,053 INFO L93 Difference]: Finished difference Result 4533 states and 11006 transitions. [2019-12-27 19:35:09,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:35:09,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 19:35:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:09,065 INFO L225 Difference]: With dead ends: 4533 [2019-12-27 19:35:09,065 INFO L226 Difference]: Without dead ends: 4533 [2019-12-27 19:35:09,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-27 19:35:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-12-27 19:35:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4465. [2019-12-27 19:35:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4465 states. [2019-12-27 19:35:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 10874 transitions. [2019-12-27 19:35:09,178 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 10874 transitions. Word has length 14 [2019-12-27 19:35:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:09,179 INFO L462 AbstractCegarLoop]: Abstraction has 4465 states and 10874 transitions. [2019-12-27 19:35:09,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:35:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 10874 transitions. [2019-12-27 19:35:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:35:09,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:09,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:09,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1284762389, now seen corresponding path program 1 times [2019-12-27 19:35:09,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:09,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202435698] [2019-12-27 19:35:09,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:09,236 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-27 19:35:09,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202435698] [2019-12-27 19:35:09,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:09,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:09,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403874811] [2019-12-27 19:35:09,238 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:09,239 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:09,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:35:09,241 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:09,242 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:09,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:09,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:09,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:09,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:09,243 INFO L87 Difference]: Start difference. First operand 4465 states and 10874 transitions. Second operand 3 states. [2019-12-27 19:35:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:09,348 INFO L93 Difference]: Finished difference Result 7903 states and 18336 transitions. [2019-12-27 19:35:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:09,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 19:35:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:09,368 INFO L225 Difference]: With dead ends: 7903 [2019-12-27 19:35:09,369 INFO L226 Difference]: Without dead ends: 7903 [2019-12-27 19:35:09,369 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-27 19:35:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7903 states. [2019-12-27 19:35:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7903 to 6842. [2019-12-27 19:35:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6842 states. [2019-12-27 19:35:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 16113 transitions. [2019-12-27 19:35:09,628 INFO L78 Accepts]: Start accepts. Automaton has 6842 states and 16113 transitions. Word has length 15 [2019-12-27 19:35:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:09,628 INFO L462 AbstractCegarLoop]: Abstraction has 6842 states and 16113 transitions. [2019-12-27 19:35:09,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6842 states and 16113 transitions. [2019-12-27 19:35:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:35:09,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:09,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:09,631 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:09,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1823214846, now seen corresponding path program 1 times [2019-12-27 19:35:09,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:09,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211278375] [2019-12-27 19:35:09,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:09,735 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-27 19:35:09,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211278375] [2019-12-27 19:35:09,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:09,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:35:09,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1199377605] [2019-12-27 19:35:09,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:09,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:09,744 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:35:09,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:09,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:09,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:35:09,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:35:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:09,746 INFO L87 Difference]: Start difference. First operand 6842 states and 16113 transitions. Second operand 4 states. [2019-12-27 19:35:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:10,071 INFO L93 Difference]: Finished difference Result 8322 states and 19313 transitions. [2019-12-27 19:35:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:35:10,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 19:35:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:10,102 INFO L225 Difference]: With dead ends: 8322 [2019-12-27 19:35:10,102 INFO L226 Difference]: Without dead ends: 8322 [2019-12-27 19:35:10,102 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-27 19:35:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-27 19:35:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 6895. [2019-12-27 19:35:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6895 states. [2019-12-27 19:35:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6895 states to 6895 states and 16226 transitions. [2019-12-27 19:35:10,243 INFO L78 Accepts]: Start accepts. Automaton has 6895 states and 16226 transitions. Word has length 17 [2019-12-27 19:35:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:10,243 INFO L462 AbstractCegarLoop]: Abstraction has 6895 states and 16226 transitions. [2019-12-27 19:35:10,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:35:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 6895 states and 16226 transitions. [2019-12-27 19:35:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:35:10,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:10,249 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] [2019-12-27 19:35:10,249 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:10,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1246091973, now seen corresponding path program 1 times [2019-12-27 19:35:10,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:10,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540885158] [2019-12-27 19:35:10,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:10,364 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-27 19:35:10,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540885158] [2019-12-27 19:35:10,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:10,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:10,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484931782] [2019-12-27 19:35:10,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:10,374 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:10,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:35:10,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:10,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:10,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:35:10,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:35:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:35:10,382 INFO L87 Difference]: Start difference. First operand 6895 states and 16226 transitions. Second operand 5 states. [2019-12-27 19:35:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:10,865 INFO L93 Difference]: Finished difference Result 9279 states and 21293 transitions. [2019-12-27 19:35:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:35:10,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 19:35:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:10,886 INFO L225 Difference]: With dead ends: 9279 [2019-12-27 19:35:10,887 INFO L226 Difference]: Without dead ends: 9279 [2019-12-27 19:35:10,887 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-27 19:35:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2019-12-27 19:35:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 8842. [2019-12-27 19:35:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8842 states. [2019-12-27 19:35:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8842 states to 8842 states and 20427 transitions. [2019-12-27 19:35:11,215 INFO L78 Accepts]: Start accepts. Automaton has 8842 states and 20427 transitions. Word has length 27 [2019-12-27 19:35:11,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:11,216 INFO L462 AbstractCegarLoop]: Abstraction has 8842 states and 20427 transitions. [2019-12-27 19:35:11,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:35:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 20427 transitions. [2019-12-27 19:35:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 19:35:11,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:11,225 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] [2019-12-27 19:35:11,225 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:11,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash -326843675, now seen corresponding path program 1 times [2019-12-27 19:35:11,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:11,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334816985] [2019-12-27 19:35:11,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:11,275 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-27 19:35:11,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334816985] [2019-12-27 19:35:11,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:11,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:11,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882545494] [2019-12-27 19:35:11,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:11,286 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:11,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 30 transitions. [2019-12-27 19:35:11,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:11,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:11,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:11,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:11,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:11,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:11,296 INFO L87 Difference]: Start difference. First operand 8842 states and 20427 transitions. Second operand 3 states. [2019-12-27 19:35:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:11,397 INFO L93 Difference]: Finished difference Result 9983 states and 21907 transitions. [2019-12-27 19:35:11,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:11,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 19:35:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:11,417 INFO L225 Difference]: With dead ends: 9983 [2019-12-27 19:35:11,417 INFO L226 Difference]: Without dead ends: 9983 [2019-12-27 19:35:11,418 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-27 19:35:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-12-27 19:35:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 8811. [2019-12-27 19:35:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-27 19:35:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 19466 transitions. [2019-12-27 19:35:11,579 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 19466 transitions. Word has length 30 [2019-12-27 19:35:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:11,579 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 19466 transitions. [2019-12-27 19:35:11,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 19466 transitions. [2019-12-27 19:35:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:35:11,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:11,589 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-27 19:35:11,589 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:11,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1451833890, now seen corresponding path program 1 times [2019-12-27 19:35:11,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:11,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533780619] [2019-12-27 19:35:11,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:11,705 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-27 19:35:11,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533780619] [2019-12-27 19:35:11,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:11,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:11,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [272595770] [2019-12-27 19:35:11,706 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:11,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:11,721 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 19:35:11,722 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:11,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:11,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:35:11,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:35:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:35:11,723 INFO L87 Difference]: Start difference. First operand 8811 states and 19466 transitions. Second operand 5 states. [2019-12-27 19:35:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:12,213 INFO L93 Difference]: Finished difference Result 9934 states and 21689 transitions. [2019-12-27 19:35:12,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:35:12,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 19:35:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:12,226 INFO L225 Difference]: With dead ends: 9934 [2019-12-27 19:35:12,227 INFO L226 Difference]: Without dead ends: 9934 [2019-12-27 19:35:12,227 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-27 19:35:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9934 states. [2019-12-27 19:35:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9934 to 7897. [2019-12-27 19:35:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-27 19:35:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 17615 transitions. [2019-12-27 19:35:12,386 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 17615 transitions. Word has length 33 [2019-12-27 19:35:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:12,386 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 17615 transitions. [2019-12-27 19:35:12,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:35:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 17615 transitions. [2019-12-27 19:35:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:35:12,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:12,398 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] [2019-12-27 19:35:12,398 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1521082095, now seen corresponding path program 1 times [2019-12-27 19:35:12,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:12,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520163296] [2019-12-27 19:35:12,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:12,450 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-27 19:35:12,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520163296] [2019-12-27 19:35:12,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:12,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:12,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [407749275] [2019-12-27 19:35:12,452 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:12,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:12,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-27 19:35:12,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:12,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:12,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:35:12,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:12,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:35:12,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:12,474 INFO L87 Difference]: Start difference. First operand 7897 states and 17615 transitions. Second operand 4 states. [2019-12-27 19:35:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:12,507 INFO L93 Difference]: Finished difference Result 5532 states and 12270 transitions. [2019-12-27 19:35:12,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:35:12,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 19:35:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:12,515 INFO L225 Difference]: With dead ends: 5532 [2019-12-27 19:35:12,515 INFO L226 Difference]: Without dead ends: 5532 [2019-12-27 19:35:12,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-12-27 19:35:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5428. [2019-12-27 19:35:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5428 states. [2019-12-27 19:35:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 12077 transitions. [2019-12-27 19:35:12,606 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 12077 transitions. Word has length 39 [2019-12-27 19:35:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:12,606 INFO L462 AbstractCegarLoop]: Abstraction has 5428 states and 12077 transitions. [2019-12-27 19:35:12,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:35:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 12077 transitions. [2019-12-27 19:35:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:35:12,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:12,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:12,620 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:12,621 INFO L82 PathProgramCache]: Analyzing trace with hash -180233684, now seen corresponding path program 1 times [2019-12-27 19:35:12,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:12,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914507214] [2019-12-27 19:35:12,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:12,793 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-27 19:35:12,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914507214] [2019-12-27 19:35:12,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:12,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:35:12,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [722449529] [2019-12-27 19:35:12,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:13,042 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:13,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 19:35:13,169 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:13,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:35:13,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:35:13,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:13,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:35:13,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:35:13,302 INFO L87 Difference]: Start difference. First operand 5428 states and 12077 transitions. Second operand 11 states. [2019-12-27 19:35:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:14,055 INFO L93 Difference]: Finished difference Result 10275 states and 22585 transitions. [2019-12-27 19:35:14,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:35:14,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-12-27 19:35:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:14,068 INFO L225 Difference]: With dead ends: 10275 [2019-12-27 19:35:14,068 INFO L226 Difference]: Without dead ends: 9146 [2019-12-27 19:35:14,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:35:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9146 states. [2019-12-27 19:35:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9146 to 6812. [2019-12-27 19:35:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2019-12-27 19:35:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 15382 transitions. [2019-12-27 19:35:14,214 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 15382 transitions. Word has length 68 [2019-12-27 19:35:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:14,214 INFO L462 AbstractCegarLoop]: Abstraction has 6812 states and 15382 transitions. [2019-12-27 19:35:14,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:35:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 15382 transitions. [2019-12-27 19:35:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:35:14,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:14,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:14,236 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1054499084, now seen corresponding path program 2 times [2019-12-27 19:35:14,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:14,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184198175] [2019-12-27 19:35:14,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:14,335 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-27 19:35:14,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184198175] [2019-12-27 19:35:14,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:14,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:14,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939748661] [2019-12-27 19:35:14,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:14,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:14,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 299 transitions. [2019-12-27 19:35:14,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:14,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:35:14,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:35:14,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:14,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:35:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:35:14,649 INFO L87 Difference]: Start difference. First operand 6812 states and 15382 transitions. Second operand 6 states. [2019-12-27 19:35:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:14,781 INFO L93 Difference]: Finished difference Result 9900 states and 22320 transitions. [2019-12-27 19:35:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:35:14,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 19:35:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:14,792 INFO L225 Difference]: With dead ends: 9900 [2019-12-27 19:35:14,792 INFO L226 Difference]: Without dead ends: 8364 [2019-12-27 19:35:14,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:35:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-12-27 19:35:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 8264. [2019-12-27 19:35:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8264 states. [2019-12-27 19:35:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 18802 transitions. [2019-12-27 19:35:14,926 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 18802 transitions. Word has length 68 [2019-12-27 19:35:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:14,926 INFO L462 AbstractCegarLoop]: Abstraction has 8264 states and 18802 transitions. [2019-12-27 19:35:14,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:35:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 18802 transitions. [2019-12-27 19:35:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:35:14,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:14,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:14,948 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:14,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash 283351324, now seen corresponding path program 3 times [2019-12-27 19:35:14,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:14,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570414501] [2019-12-27 19:35:14,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:15,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570414501] [2019-12-27 19:35:15,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:15,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:35:15,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849739889] [2019-12-27 19:35:15,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:15,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:15,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 198 transitions. [2019-12-27 19:35:15,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:15,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:35:15,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:35:15,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:15,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:35:15,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:35:15,200 INFO L87 Difference]: Start difference. First operand 8264 states and 18802 transitions. Second operand 9 states. [2019-12-27 19:35:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:15,784 INFO L93 Difference]: Finished difference Result 12633 states and 28391 transitions. [2019-12-27 19:35:15,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 19:35:15,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-27 19:35:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:15,800 INFO L225 Difference]: With dead ends: 12633 [2019-12-27 19:35:15,800 INFO L226 Difference]: Without dead ends: 12150 [2019-12-27 19:35:15,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:35:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12150 states. [2019-12-27 19:35:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12150 to 8320. [2019-12-27 19:35:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8320 states. [2019-12-27 19:35:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 18925 transitions. [2019-12-27 19:35:15,979 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 18925 transitions. Word has length 68 [2019-12-27 19:35:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:15,979 INFO L462 AbstractCegarLoop]: Abstraction has 8320 states and 18925 transitions. [2019-12-27 19:35:15,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:35:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 18925 transitions. [2019-12-27 19:35:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:35:15,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:16,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:16,000 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:16,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:16,000 INFO L82 PathProgramCache]: Analyzing trace with hash 741146474, now seen corresponding path program 4 times [2019-12-27 19:35:16,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:16,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80480610] [2019-12-27 19:35:16,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:16,073 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-27 19:35:16,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80480610] [2019-12-27 19:35:16,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:16,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:16,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [348713385] [2019-12-27 19:35:16,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:16,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:16,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 19:35:16,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:16,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:35:16,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:35:16,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:16,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:35:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:35:16,237 INFO L87 Difference]: Start difference. First operand 8320 states and 18925 transitions. Second operand 5 states. [2019-12-27 19:35:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:16,376 INFO L93 Difference]: Finished difference Result 9398 states and 21184 transitions. [2019-12-27 19:35:16,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:35:16,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 19:35:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:16,377 INFO L225 Difference]: With dead ends: 9398 [2019-12-27 19:35:16,377 INFO L226 Difference]: Without dead ends: 1086 [2019-12-27 19:35:16,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:35:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-12-27 19:35:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 909. [2019-12-27 19:35:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 19:35:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1891 transitions. [2019-12-27 19:35:16,388 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1891 transitions. Word has length 68 [2019-12-27 19:35:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:16,388 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1891 transitions. [2019-12-27 19:35:16,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:35:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1891 transitions. [2019-12-27 19:35:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 19:35:16,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:16,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:16,391 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1610368982, now seen corresponding path program 1 times [2019-12-27 19:35:16,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:16,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834528883] [2019-12-27 19:35:16,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:16,496 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-27 19:35:16,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834528883] [2019-12-27 19:35:16,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:16,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:35:16,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878128692] [2019-12-27 19:35:16,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:16,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:16,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 304 transitions. [2019-12-27 19:35:16,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:16,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 19:35:16,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:35:16,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:16,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:35:16,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:35:16,810 INFO L87 Difference]: Start difference. First operand 909 states and 1891 transitions. Second operand 5 states. [2019-12-27 19:35:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:17,080 INFO L93 Difference]: Finished difference Result 1025 states and 2099 transitions. [2019-12-27 19:35:17,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:35:17,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 19:35:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:17,083 INFO L225 Difference]: With dead ends: 1025 [2019-12-27 19:35:17,083 INFO L226 Difference]: Without dead ends: 1025 [2019-12-27 19:35:17,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:35:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-12-27 19:35:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 987. [2019-12-27 19:35:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-12-27 19:35:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2032 transitions. [2019-12-27 19:35:17,093 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2032 transitions. Word has length 69 [2019-12-27 19:35:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:17,094 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 2032 transitions. [2019-12-27 19:35:17,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:35:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2032 transitions. [2019-12-27 19:35:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 19:35:17,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:17,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:17,096 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:17,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:17,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1863095554, now seen corresponding path program 2 times [2019-12-27 19:35:17,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:17,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476935712] [2019-12-27 19:35:17,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:17,212 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-27 19:35:17,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476935712] [2019-12-27 19:35:17,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:17,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:35:17,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369442313] [2019-12-27 19:35:17,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:17,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:17,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 222 transitions. [2019-12-27 19:35:17,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:17,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:17,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:17,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:17,383 INFO L87 Difference]: Start difference. First operand 987 states and 2032 transitions. Second operand 3 states. [2019-12-27 19:35:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:17,400 INFO L93 Difference]: Finished difference Result 987 states and 2031 transitions. [2019-12-27 19:35:17,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:17,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 19:35:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:17,402 INFO L225 Difference]: With dead ends: 987 [2019-12-27 19:35:17,402 INFO L226 Difference]: Without dead ends: 987 [2019-12-27 19:35:17,403 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-27 19:35:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-12-27 19:35:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 918. [2019-12-27 19:35:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-12-27 19:35:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1909 transitions. [2019-12-27 19:35:17,421 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1909 transitions. Word has length 69 [2019-12-27 19:35:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:17,421 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 1909 transitions. [2019-12-27 19:35:17,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1909 transitions. [2019-12-27 19:35:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 19:35:17,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:17,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:17,425 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:17,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash 230274807, now seen corresponding path program 1 times [2019-12-27 19:35:17,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:17,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737747314] [2019-12-27 19:35:17,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:17,628 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-27 19:35:17,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737747314] [2019-12-27 19:35:17,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:17,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:35:17,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [596399800] [2019-12-27 19:35:17,631 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:17,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:17,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 305 transitions. [2019-12-27 19:35:17,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:17,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 19:35:17,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 19:35:17,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 19:35:17,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:35:17,983 INFO L87 Difference]: Start difference. First operand 918 states and 1909 transitions. Second operand 14 states. [2019-12-27 19:35:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:19,655 INFO L93 Difference]: Finished difference Result 2033 states and 3994 transitions. [2019-12-27 19:35:19,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 19:35:19,656 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-12-27 19:35:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:19,658 INFO L225 Difference]: With dead ends: 2033 [2019-12-27 19:35:19,659 INFO L226 Difference]: Without dead ends: 2009 [2019-12-27 19:35:19,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:35:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-12-27 19:35:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1196. [2019-12-27 19:35:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2019-12-27 19:35:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 2410 transitions. [2019-12-27 19:35:19,674 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 2410 transitions. Word has length 70 [2019-12-27 19:35:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:19,674 INFO L462 AbstractCegarLoop]: Abstraction has 1196 states and 2410 transitions. [2019-12-27 19:35:19,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 19:35:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2410 transitions. [2019-12-27 19:35:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 19:35:19,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:19,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:19,676 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash 533493023, now seen corresponding path program 2 times [2019-12-27 19:35:19,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:19,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083112675] [2019-12-27 19:35:19,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:19,779 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-27 19:35:19,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083112675] [2019-12-27 19:35:19,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:19,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:19,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1465517226] [2019-12-27 19:35:19,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:19,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:19,912 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 222 transitions. [2019-12-27 19:35:19,912 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:19,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:35:19,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:35:19,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:19,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:35:19,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:19,915 INFO L87 Difference]: Start difference. First operand 1196 states and 2410 transitions. Second operand 4 states. [2019-12-27 19:35:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:19,979 INFO L93 Difference]: Finished difference Result 1335 states and 2682 transitions. [2019-12-27 19:35:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:35:19,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-27 19:35:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:19,981 INFO L225 Difference]: With dead ends: 1335 [2019-12-27 19:35:19,982 INFO L226 Difference]: Without dead ends: 1335 [2019-12-27 19:35:19,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:35:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-12-27 19:35:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1144. [2019-12-27 19:35:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-27 19:35:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2312 transitions. [2019-12-27 19:35:19,998 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2312 transitions. Word has length 70 [2019-12-27 19:35:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:19,998 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2312 transitions. [2019-12-27 19:35:19,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:35:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2312 transitions. [2019-12-27 19:35:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 19:35:20,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:20,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:20,001 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:20,001 INFO L82 PathProgramCache]: Analyzing trace with hash 309404191, now seen corresponding path program 1 times [2019-12-27 19:35:20,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:20,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385168928] [2019-12-27 19:35:20,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:35:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:35:20,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:35:20,155 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:35:20,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= v_~y$w_buff1_used~0_73 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_23) (= v_~main$tmp_guard0~0_9 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_23|)) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t0~0.base_23|) (= v_~y$r_buff0_thd1~0_79 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~__unbuffered_cnt~0_17) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t0~0.base_23| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_23| 1) |v_#valid_46|) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~weak$$choice2~0_36) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_23|) |v_ULTIMATE.start_main_~#t0~0.offset_18| 0))) (= v_~y$r_buff0_thd2~0_63 0) (= v_~y$r_buff0_thd0~0_19 0) (= v_~y$w_buff0_used~0_136 0) (= 0 v_~y$flush_delayed~0_18) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~y~0_32 0) (= v_~y$mem_tmp~0_14 0) (= v_~main$tmp_guard1~0_14 0) (= v_~__unbuffered_p0_EBX~0_12 0) (= 0 v_~y$w_buff1~0_32) (= |v_ULTIMATE.start_main_~#t0~0.offset_18| 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$r_buff1_thd2~0_38) (= 0 v_~y$w_buff0~0_34) (= 0 v_~x~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_11|, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_18|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_11|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_79, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_17|, ~y~0=v_~y~0_32, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_23|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_38, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_13|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_46|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_36, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_23, ~x~0=v_~x~0_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_~#t0~0.offset, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t0~0.base, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t1~0.base, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 19:35:20,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L5-->L744: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out-1127912689) (= ~y$mem_tmp~0_Out-1127912689 ~y~0_In-1127912689) (= ~y$r_buff0_thd1~0_In-1127912689 ~y$r_buff1_thd1~0_Out-1127912689) (= ~weak$$choice0~0_Out-1127912689 |P0Thread1of1ForFork1_#t~nondet3_In-1127912689|) (= ~y$r_buff1_thd0~0_Out-1127912689 ~y$r_buff0_thd0~0_In-1127912689) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1127912689)) (= ~weak$$choice2~0_Out-1127912689 ~y$flush_delayed~0_Out-1127912689) (= ~y$r_buff1_thd2~0_Out-1127912689 ~y$r_buff0_thd2~0_In-1127912689) (= |P0Thread1of1ForFork1_#t~nondet4_In-1127912689| ~weak$$choice2~0_Out-1127912689)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1127912689, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1127912689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1127912689, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1127912689, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-1127912689|, ~y~0=~y~0_In-1127912689, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-1127912689|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1127912689, ~weak$$choice0~0=~weak$$choice0~0_Out-1127912689, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1127912689, ~y$mem_tmp~0=~y$mem_tmp~0_Out-1127912689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1127912689, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1127912689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1127912689, ~y$flush_delayed~0=~y$flush_delayed~0_Out-1127912689, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1127912689, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-1127912689|, ~y~0=~y~0_In-1127912689, ~weak$$choice2~0=~weak$$choice2~0_Out-1127912689, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-1127912689|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1127912689} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 19:35:20,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L818-1-->L820: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1~0.base_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t1~0.base_11| 0)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 19:35:20,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1578871531 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1578871531 256))) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out-1578871531| |P0Thread1of1ForFork1_#t~ite5_Out-1578871531|))) (or (and (or .cse0 .cse1) .cse2 (= ~y$w_buff1~0_In-1578871531 |P0Thread1of1ForFork1_#t~ite5_Out-1578871531|)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1578871531| ~y$w_buff0~0_In-1578871531) (not .cse1) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1578871531, ~y$w_buff1~0=~y$w_buff1~0_In-1578871531, ~y$w_buff0~0=~y$w_buff0~0_In-1578871531, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1578871531} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1578871531|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1578871531, ~y$w_buff1~0=~y$w_buff1~0_In-1578871531, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1578871531|, ~y$w_buff0~0=~y$w_buff0~0_In-1578871531, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1578871531} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 19:35:20,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_48)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:35:20,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1758687427 256) 0))) (or (and (= ~y~0_In1758687427 |P0Thread1of1ForFork1_#t~ite25_Out1758687427|) .cse0) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out1758687427| ~y$mem_tmp~0_In1758687427)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1758687427, ~y$flush_delayed~0=~y$flush_delayed~0_In1758687427, ~y~0=~y~0_In1758687427} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1758687427, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out1758687427|, ~y$flush_delayed~0=~y$flush_delayed~0_In1758687427, ~y~0=~y~0_In1758687427} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 19:35:20,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-2013507071 256)))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out-2013507071| ~y~0_In-2013507071)) (and (= |P1Thread1of1ForFork0_#t~ite54_Out-2013507071| ~y$mem_tmp~0_In-2013507071) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2013507071, ~y$flush_delayed~0=~y$flush_delayed~0_In-2013507071, ~y~0=~y~0_In-2013507071} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2013507071, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-2013507071|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2013507071, ~y~0=~y~0_In-2013507071} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 19:35:20,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In341015037 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In341015037 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite28_Out341015037| ~y$w_buff0_used~0_In341015037)) (and (= |P0Thread1of1ForFork1_#t~ite28_Out341015037| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In341015037, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In341015037} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In341015037, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out341015037|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In341015037} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 19:35:20,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-476569478 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-476569478 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-476569478 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-476569478 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-476569478 |P0Thread1of1ForFork1_#t~ite29_Out-476569478|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-476569478|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-476569478, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-476569478, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-476569478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-476569478} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-476569478, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-476569478, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-476569478|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-476569478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-476569478} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 19:35:20,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In438282261 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In438282261 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out438282261 ~y$r_buff0_thd1~0_In438282261)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out438282261 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In438282261, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In438282261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In438282261, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out438282261, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out438282261|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 19:35:20,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-207719737 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-207719737 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-207719737 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-207719737 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite31_Out-207719737| ~y$r_buff1_thd1~0_In-207719737) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite31_Out-207719737| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-207719737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-207719737, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-207719737, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-207719737} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-207719737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-207719737, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-207719737, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-207719737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-207719737} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 19:35:20,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1598975623 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1598975623 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite55_Out-1598975623| ~y$w_buff1~0_In-1598975623) (not .cse0) (not .cse1)) (and (= ~y~0_In-1598975623 |P1Thread1of1ForFork0_#t~ite55_Out-1598975623|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1598975623, ~y$w_buff1~0=~y$w_buff1~0_In-1598975623, ~y~0=~y~0_In-1598975623, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1598975623} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1598975623, ~y$w_buff1~0=~y$w_buff1~0_In-1598975623, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1598975623|, ~y~0=~y~0_In-1598975623, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1598975623} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 19:35:20,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_27 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_7|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-27 19:35:20,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1144151357 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1144151357 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite57_Out1144151357| ~y$w_buff0_used~0_In1144151357) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1144151357| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1144151357, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1144151357} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1144151357, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1144151357, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out1144151357|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-27 19:35:20,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In973213090 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In973213090 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In973213090 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In973213090 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite58_Out973213090|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite58_Out973213090| ~y$w_buff1_used~0_In973213090)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In973213090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In973213090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In973213090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In973213090} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In973213090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In973213090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In973213090, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out973213090|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In973213090} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-27 19:35:20,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In969423065 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In969423065 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite59_Out969423065| 0)) (and (= ~y$r_buff0_thd2~0_In969423065 |P1Thread1of1ForFork0_#t~ite59_Out969423065|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In969423065, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In969423065} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In969423065, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In969423065, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out969423065|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-27 19:35:20,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd1~0_36 |v_P0Thread1of1ForFork1_#t~ite31_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_8|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_36, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 19:35:20,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1483156140 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1483156140 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1483156140 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1483156140 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In1483156140 |P1Thread1of1ForFork0_#t~ite60_Out1483156140|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite60_Out1483156140|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1483156140, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1483156140, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1483156140, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1483156140} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1483156140, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1483156140, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1483156140|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1483156140, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1483156140} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-27 19:35:20,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y$r_buff1_thd2~0_34 |v_P1Thread1of1ForFork0_#t~ite60_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 19:35:20,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 19:35:20,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1393940405 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1393940405 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite64_Out-1393940405| |ULTIMATE.start_main_#t~ite63_Out-1393940405|))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1393940405| ~y$w_buff1~0_In-1393940405) .cse0 (not .cse1) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1393940405| ~y~0_In-1393940405) (or .cse2 .cse1) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1393940405, ~y~0=~y~0_In-1393940405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1393940405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1393940405} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1393940405|, ~y$w_buff1~0=~y$w_buff1~0_In-1393940405, ~y~0=~y~0_In-1393940405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1393940405, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1393940405|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1393940405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 19:35:20,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-32205710 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-32205710 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite65_Out-32205710|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-32205710 |ULTIMATE.start_main_#t~ite65_Out-32205710|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-32205710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-32205710} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-32205710, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-32205710, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-32205710|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 19:35:20,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1477213021 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1477213021 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1477213021 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1477213021 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite66_Out1477213021|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1477213021 |ULTIMATE.start_main_#t~ite66_Out1477213021|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1477213021, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1477213021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1477213021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1477213021} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1477213021, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1477213021, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1477213021|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1477213021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1477213021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 19:35:20,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1805321681 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1805321681 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite67_Out-1805321681| ~y$r_buff0_thd0~0_In-1805321681) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite67_Out-1805321681|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805321681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1805321681} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805321681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1805321681, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1805321681|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 19:35:20,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In170029401 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In170029401 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In170029401 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In170029401 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out170029401|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In170029401 |ULTIMATE.start_main_#t~ite68_Out170029401|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In170029401, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In170029401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In170029401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In170029401} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In170029401, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In170029401, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out170029401|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In170029401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In170029401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 19:35:20,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_~__unbuffered_p0_EAX~0_9 1) (= 0 v_~__unbuffered_p1_EBX~0_9) (= |v_ULTIMATE.start_main_#t~ite68_15| v_~y$r_buff1_thd0~0_20)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_15|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 19:35:20,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:35:20 BasicIcfg [2019-12-27 19:35:20,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:35:20,362 INFO L168 Benchmark]: Toolchain (without parser) took 24165.76 ms. Allocated memory was 138.9 MB in the beginning and 1.0 GB in the end (delta: 881.9 MB). Free memory was 102.6 MB in the beginning and 431.2 MB in the end (delta: -328.5 MB). Peak memory consumption was 553.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:20,363 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 19:35:20,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.39 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 154.0 MB in the end (delta: -51.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:20,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.35 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:20,372 INFO L168 Benchmark]: Boogie Preprocessor took 54.90 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:20,374 INFO L168 Benchmark]: RCFGBuilder took 968.56 ms. Allocated memory is still 202.9 MB. Free memory was 148.6 MB in the beginning and 92.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:20,375 INFO L168 Benchmark]: TraceAbstraction took 22235.21 ms. Allocated memory was 234.9 MB in the beginning and 1.0 GB in the end (delta: 785.9 MB). Free memory was 205.9 MB in the beginning and 431.2 MB in the end (delta: -225.2 MB). Peak memory consumption was 560.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:20,381 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.39 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 154.0 MB in the end (delta: -51.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.35 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.90 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 968.56 ms. Allocated memory is still 202.9 MB. Free memory was 148.6 MB in the beginning and 92.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22235.21 ms. Allocated memory was 234.9 MB in the beginning and 1.0 GB in the end (delta: 785.9 MB). Free memory was 205.9 MB in the beginning and 431.2 MB in the end (delta: -225.2 MB). Peak memory consumption was 560.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 191 ProgramPointsBefore, 116 ProgramPointsAfterwards, 246 TransitionsBefore, 141 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 9313 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 156567 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L784] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4060 SDtfs, 4024 SDslu, 10767 SDs, 0 SdLazy, 3652 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 80 SyntacticMatches, 20 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 13858 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 722 ConstructedInterpolants, 0 QuantifiedInterpolants, 188610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...