/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:14:47,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:14:47,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:14:47,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:14:47,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:14:47,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:14:47,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:14:47,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:14:47,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:14:47,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:14:47,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:14:47,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:14:47,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:14:47,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:14:47,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:14:47,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:14:47,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:14:47,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:14:47,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:14:47,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:14:47,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:14:47,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:14:47,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:14:47,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:14:47,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:14:47,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:14:47,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:14:47,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:14:47,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:14:47,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:14:47,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:14:47,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:14:47,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:14:47,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:14:47,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:14:47,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:14:47,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:14:47,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:14:47,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:14:47,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:14:47,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:14:47,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:14:47,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:14:47,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:14:47,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:14:47,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:14:47,134 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:14:47,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:14:47,134 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:14:47,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:14:47,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:14:47,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:14:47,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:14:47,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:14:47,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:14:47,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:14:47,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:14:47,136 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:14:47,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:14:47,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:14:47,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:14:47,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:14:47,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:14:47,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:14:47,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:14:47,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:14:47,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:14:47,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:14:47,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:14:47,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:14:47,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:14:47,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:14:47,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:14:47,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:14:47,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:14:47,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:14:47,423 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:14:47,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-18 13:14:47,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab107fb66/8d407ab5e30142c49de11072495d52b9/FLAGf40d27916 [2019-12-18 13:14:48,021 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:14:48,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-18 13:14:48,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab107fb66/8d407ab5e30142c49de11072495d52b9/FLAGf40d27916 [2019-12-18 13:14:48,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab107fb66/8d407ab5e30142c49de11072495d52b9 [2019-12-18 13:14:48,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:14:48,356 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:14:48,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:14:48,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:14:48,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:14:48,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:14:48" (1/1) ... [2019-12-18 13:14:48,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:48, skipping insertion in model container [2019-12-18 13:14:48,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:14:48" (1/1) ... [2019-12-18 13:14:48,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:14:48,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:14:48,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:14:48,963 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:14:49,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:14:49,113 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:14:49,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49 WrapperNode [2019-12-18 13:14:49,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:14:49,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:14:49,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:14:49,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:14:49,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... [2019-12-18 13:14:49,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... [2019-12-18 13:14:49,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:14:49,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:14:49,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:14:49,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:14:49,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... [2019-12-18 13:14:49,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... [2019-12-18 13:14:49,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... [2019-12-18 13:14:49,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... [2019-12-18 13:14:49,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... [2019-12-18 13:14:49,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... [2019-12-18 13:14:49,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... [2019-12-18 13:14:49,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:14:49,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:14:49,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:14:49,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:14:49,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:14:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:14:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:14:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:14:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:14:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:14:49,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:14:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:14:49,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:14:49,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:14:49,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:14:49,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:14:49,307 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:14:49,999 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:14:49,999 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:14:50,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:14:50 BoogieIcfgContainer [2019-12-18 13:14:50,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:14:50,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:14:50,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:14:50,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:14:50,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:14:48" (1/3) ... [2019-12-18 13:14:50,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594a30ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:14:50, skipping insertion in model container [2019-12-18 13:14:50,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:14:49" (2/3) ... [2019-12-18 13:14:50,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594a30ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:14:50, skipping insertion in model container [2019-12-18 13:14:50,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:14:50" (3/3) ... [2019-12-18 13:14:50,010 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.oepc.i [2019-12-18 13:14:50,021 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:14:50,021 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:14:50,029 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:14:50,030 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:14:50,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,076 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,154 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,155 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,155 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,167 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:14:50,184 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:14:50,204 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:14:50,204 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:14:50,204 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:14:50,204 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:14:50,204 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:14:50,204 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:14:50,205 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:14:50,205 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:14:50,221 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-18 13:14:50,224 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-18 13:14:50,304 INFO L126 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-18 13:14:50,304 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:14:50,322 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:14:50,343 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-18 13:14:50,383 INFO L126 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-18 13:14:50,383 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:14:50,391 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:14:50,406 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 13:14:50,407 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:14:55,737 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 13:14:55,859 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 13:14:55,884 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-18 13:14:55,884 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-18 13:14:55,887 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-18 13:14:56,286 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 13:14:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 13:14:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:14:56,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:56,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:14:56,296 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:56,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-18 13:14:56,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:56,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229038098] [2019-12-18 13:14:56,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:56,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229038098] [2019-12-18 13:14:56,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:56,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:14:56,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227723057] [2019-12-18 13:14:56,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:14:56,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:56,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:14:56,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:56,557 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 13:14:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:56,891 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-18 13:14:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:14:56,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:14:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:56,981 INFO L225 Difference]: With dead ends: 8472 [2019-12-18 13:14:56,981 INFO L226 Difference]: Without dead ends: 7980 [2019-12-18 13:14:56,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-18 13:14:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-18 13:14:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-18 13:14:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-18 13:14:57,360 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-18 13:14:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:57,361 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-18 13:14:57,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:14:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-18 13:14:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:14:57,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:57,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:57,365 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-18 13:14:57,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:57,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220505525] [2019-12-18 13:14:57,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:57,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220505525] [2019-12-18 13:14:57,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:57,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:14:57,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694543220] [2019-12-18 13:14:57,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:14:57,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:14:57,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:57,440 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 3 states. [2019-12-18 13:14:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:57,474 INFO L93 Difference]: Finished difference Result 1284 states and 2972 transitions. [2019-12-18 13:14:57,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:14:57,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 13:14:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:57,482 INFO L225 Difference]: With dead ends: 1284 [2019-12-18 13:14:57,482 INFO L226 Difference]: Without dead ends: 1284 [2019-12-18 13:14:57,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:57,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-12-18 13:14:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-12-18 13:14:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-18 13:14:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2972 transitions. [2019-12-18 13:14:57,524 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2972 transitions. Word has length 11 [2019-12-18 13:14:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:57,524 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2972 transitions. [2019-12-18 13:14:57,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:14:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2972 transitions. [2019-12-18 13:14:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:14:57,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:57,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:57,532 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:57,533 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-18 13:14:57,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:57,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098161830] [2019-12-18 13:14:57,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:57,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098161830] [2019-12-18 13:14:57,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:57,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:14:57,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791339000] [2019-12-18 13:14:57,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:14:57,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:57,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:14:57,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:57,648 INFO L87 Difference]: Start difference. First operand 1284 states and 2972 transitions. Second operand 3 states. [2019-12-18 13:14:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:57,744 INFO L93 Difference]: Finished difference Result 1993 states and 4593 transitions. [2019-12-18 13:14:57,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:14:57,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 13:14:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:57,759 INFO L225 Difference]: With dead ends: 1993 [2019-12-18 13:14:57,759 INFO L226 Difference]: Without dead ends: 1993 [2019-12-18 13:14:57,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-18 13:14:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1444. [2019-12-18 13:14:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-18 13:14:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3429 transitions. [2019-12-18 13:14:57,807 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3429 transitions. Word has length 14 [2019-12-18 13:14:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:57,808 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3429 transitions. [2019-12-18 13:14:57,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:14:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3429 transitions. [2019-12-18 13:14:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:14:57,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:57,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:57,811 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-18 13:14:57,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:57,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392120341] [2019-12-18 13:14:57,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:58,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392120341] [2019-12-18 13:14:58,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:58,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:14:58,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737843704] [2019-12-18 13:14:58,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:14:58,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:58,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:14:58,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:14:58,004 INFO L87 Difference]: Start difference. First operand 1444 states and 3429 transitions. Second operand 4 states. [2019-12-18 13:14:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:58,246 INFO L93 Difference]: Finished difference Result 1803 states and 4159 transitions. [2019-12-18 13:14:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:14:58,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:14:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:58,258 INFO L225 Difference]: With dead ends: 1803 [2019-12-18 13:14:58,263 INFO L226 Difference]: Without dead ends: 1803 [2019-12-18 13:14:58,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-18 13:14:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1739. [2019-12-18 13:14:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-18 13:14:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4035 transitions. [2019-12-18 13:14:58,320 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4035 transitions. Word has length 14 [2019-12-18 13:14:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:58,321 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 4035 transitions. [2019-12-18 13:14:58,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:14:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4035 transitions. [2019-12-18 13:14:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:14:58,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:58,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:58,322 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:58,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:58,323 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-18 13:14:58,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:58,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053496454] [2019-12-18 13:14:58,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:58,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053496454] [2019-12-18 13:14:58,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:58,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:14:58,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733495927] [2019-12-18 13:14:58,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:14:58,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:58,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:14:58,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:14:58,427 INFO L87 Difference]: Start difference. First operand 1739 states and 4035 transitions. Second operand 4 states. [2019-12-18 13:14:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:58,601 INFO L93 Difference]: Finished difference Result 2116 states and 4835 transitions. [2019-12-18 13:14:58,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:14:58,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:14:58,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:58,613 INFO L225 Difference]: With dead ends: 2116 [2019-12-18 13:14:58,613 INFO L226 Difference]: Without dead ends: 2116 [2019-12-18 13:14:58,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-18 13:14:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1856. [2019-12-18 13:14:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-18 13:14:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4299 transitions. [2019-12-18 13:14:58,659 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4299 transitions. Word has length 14 [2019-12-18 13:14:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:58,659 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 4299 transitions. [2019-12-18 13:14:58,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:14:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4299 transitions. [2019-12-18 13:14:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:14:58,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:58,662 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] [2019-12-18 13:14:58,662 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:58,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:58,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-18 13:14:58,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:58,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089471984] [2019-12-18 13:14:58,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:58,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089471984] [2019-12-18 13:14:58,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:58,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:14:58,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437015698] [2019-12-18 13:14:58,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:14:58,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:58,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:14:58,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:58,754 INFO L87 Difference]: Start difference. First operand 1856 states and 4299 transitions. Second operand 5 states. [2019-12-18 13:14:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:59,019 INFO L93 Difference]: Finished difference Result 2383 states and 5349 transitions. [2019-12-18 13:14:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:14:59,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 13:14:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:59,033 INFO L225 Difference]: With dead ends: 2383 [2019-12-18 13:14:59,033 INFO L226 Difference]: Without dead ends: 2383 [2019-12-18 13:14:59,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:14:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-18 13:14:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2127. [2019-12-18 13:14:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-18 13:14:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4855 transitions. [2019-12-18 13:14:59,086 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4855 transitions. Word has length 25 [2019-12-18 13:14:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:59,087 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4855 transitions. [2019-12-18 13:14:59,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:14:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4855 transitions. [2019-12-18 13:14:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:14:59,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:59,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:59,090 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:59,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1878239565, now seen corresponding path program 1 times [2019-12-18 13:14:59,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:59,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368408687] [2019-12-18 13:14:59,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:59,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368408687] [2019-12-18 13:14:59,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:59,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:14:59,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681960146] [2019-12-18 13:14:59,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:14:59,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:59,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:14:59,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:59,138 INFO L87 Difference]: Start difference. First operand 2127 states and 4855 transitions. Second operand 3 states. [2019-12-18 13:14:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:59,151 INFO L93 Difference]: Finished difference Result 2126 states and 4853 transitions. [2019-12-18 13:14:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:14:59,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 13:14:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:59,161 INFO L225 Difference]: With dead ends: 2126 [2019-12-18 13:14:59,161 INFO L226 Difference]: Without dead ends: 2126 [2019-12-18 13:14:59,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:14:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-18 13:14:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2126. [2019-12-18 13:14:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-18 13:14:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 4853 transitions. [2019-12-18 13:14:59,210 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 4853 transitions. Word has length 26 [2019-12-18 13:14:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:59,211 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 4853 transitions. [2019-12-18 13:14:59,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:14:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 4853 transitions. [2019-12-18 13:14:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:14:59,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:59,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:14:59,214 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:59,215 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-18 13:14:59,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:59,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596496864] [2019-12-18 13:14:59,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:59,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596496864] [2019-12-18 13:14:59,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:59,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:14:59,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754191426] [2019-12-18 13:14:59,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:14:59,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:59,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:14:59,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:59,294 INFO L87 Difference]: Start difference. First operand 2126 states and 4853 transitions. Second operand 5 states. [2019-12-18 13:14:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:59,367 INFO L93 Difference]: Finished difference Result 2177 states and 4941 transitions. [2019-12-18 13:14:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:14:59,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:14:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:59,377 INFO L225 Difference]: With dead ends: 2177 [2019-12-18 13:14:59,377 INFO L226 Difference]: Without dead ends: 2177 [2019-12-18 13:14:59,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2019-12-18 13:14:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2177. [2019-12-18 13:14:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2177 states. [2019-12-18 13:14:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 4941 transitions. [2019-12-18 13:14:59,436 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 4941 transitions. Word has length 26 [2019-12-18 13:14:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:59,437 INFO L462 AbstractCegarLoop]: Abstraction has 2177 states and 4941 transitions. [2019-12-18 13:14:59,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:14:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 4941 transitions. [2019-12-18 13:14:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:14:59,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:59,491 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-18 13:14:59,491 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:59,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1895680429, now seen corresponding path program 1 times [2019-12-18 13:14:59,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:59,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266480616] [2019-12-18 13:14:59,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:59,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266480616] [2019-12-18 13:14:59,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:59,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:14:59,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834346631] [2019-12-18 13:14:59,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:14:59,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:59,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:14:59,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:14:59,569 INFO L87 Difference]: Start difference. First operand 2177 states and 4941 transitions. Second operand 4 states. [2019-12-18 13:14:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:14:59,602 INFO L93 Difference]: Finished difference Result 3372 states and 7800 transitions. [2019-12-18 13:14:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:14:59,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 13:14:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:14:59,614 INFO L225 Difference]: With dead ends: 3372 [2019-12-18 13:14:59,614 INFO L226 Difference]: Without dead ends: 1522 [2019-12-18 13:14:59,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2019-12-18 13:14:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1502. [2019-12-18 13:14:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-18 13:14:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 3438 transitions. [2019-12-18 13:14:59,649 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 3438 transitions. Word has length 27 [2019-12-18 13:14:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:14:59,649 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 3438 transitions. [2019-12-18 13:14:59,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:14:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 3438 transitions. [2019-12-18 13:14:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:14:59,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:14:59,656 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-18 13:14:59,656 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:14:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:14:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1902769443, now seen corresponding path program 2 times [2019-12-18 13:14:59,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:14:59,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422744009] [2019-12-18 13:14:59,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:14:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:14:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:14:59,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422744009] [2019-12-18 13:14:59,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:14:59,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:14:59,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751417686] [2019-12-18 13:14:59,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:14:59,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:14:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:14:59,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:14:59,754 INFO L87 Difference]: Start difference. First operand 1502 states and 3438 transitions. Second operand 5 states. [2019-12-18 13:15:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:00,204 INFO L93 Difference]: Finished difference Result 2346 states and 5237 transitions. [2019-12-18 13:15:00,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:15:00,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:15:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:00,214 INFO L225 Difference]: With dead ends: 2346 [2019-12-18 13:15:00,214 INFO L226 Difference]: Without dead ends: 2346 [2019-12-18 13:15:00,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:15:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-12-18 13:15:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2144. [2019-12-18 13:15:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2144 states. [2019-12-18 13:15:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 4844 transitions. [2019-12-18 13:15:00,261 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 4844 transitions. Word has length 27 [2019-12-18 13:15:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:00,262 INFO L462 AbstractCegarLoop]: Abstraction has 2144 states and 4844 transitions. [2019-12-18 13:15:00,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:15:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 4844 transitions. [2019-12-18 13:15:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:15:00,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:00,266 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-18 13:15:00,267 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash -376693979, now seen corresponding path program 1 times [2019-12-18 13:15:00,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:00,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997764080] [2019-12-18 13:15:00,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:15:00,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997764080] [2019-12-18 13:15:00,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:00,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:15:00,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775653972] [2019-12-18 13:15:00,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:15:00,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:00,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:15:00,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:15:00,346 INFO L87 Difference]: Start difference. First operand 2144 states and 4844 transitions. Second operand 5 states. [2019-12-18 13:15:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:00,510 INFO L93 Difference]: Finished difference Result 2147 states and 4831 transitions. [2019-12-18 13:15:00,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:15:00,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:15:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:00,519 INFO L225 Difference]: With dead ends: 2147 [2019-12-18 13:15:00,520 INFO L226 Difference]: Without dead ends: 2147 [2019-12-18 13:15:00,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:15:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2019-12-18 13:15:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2102. [2019-12-18 13:15:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2019-12-18 13:15:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 4764 transitions. [2019-12-18 13:15:00,576 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 4764 transitions. Word has length 27 [2019-12-18 13:15:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:00,576 INFO L462 AbstractCegarLoop]: Abstraction has 2102 states and 4764 transitions. [2019-12-18 13:15:00,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:15:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 4764 transitions. [2019-12-18 13:15:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:15:00,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:00,582 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] [2019-12-18 13:15:00,582 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:00,583 INFO L82 PathProgramCache]: Analyzing trace with hash -348234267, now seen corresponding path program 1 times [2019-12-18 13:15:00,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:00,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194107510] [2019-12-18 13:15:00,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:15:00,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194107510] [2019-12-18 13:15:00,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:00,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:15:00,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845758601] [2019-12-18 13:15:00,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:15:00,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:00,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:15:00,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:00,658 INFO L87 Difference]: Start difference. First operand 2102 states and 4764 transitions. Second operand 4 states. [2019-12-18 13:15:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:00,676 INFO L93 Difference]: Finished difference Result 1136 states and 2440 transitions. [2019-12-18 13:15:00,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:15:00,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 13:15:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:00,679 INFO L225 Difference]: With dead ends: 1136 [2019-12-18 13:15:00,679 INFO L226 Difference]: Without dead ends: 1022 [2019-12-18 13:15:00,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-12-18 13:15:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 980. [2019-12-18 13:15:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-18 13:15:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2183 transitions. [2019-12-18 13:15:00,699 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2183 transitions. Word has length 28 [2019-12-18 13:15:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:00,701 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 2183 transitions. [2019-12-18 13:15:00,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:15:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2183 transitions. [2019-12-18 13:15:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:15:00,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:00,706 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] [2019-12-18 13:15:00,706 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:00,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:00,706 INFO L82 PathProgramCache]: Analyzing trace with hash -359202268, now seen corresponding path program 1 times [2019-12-18 13:15:00,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:00,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079364636] [2019-12-18 13:15:00,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:15:00,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079364636] [2019-12-18 13:15:00,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:00,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:15:00,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014603705] [2019-12-18 13:15:00,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:15:00,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:00,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:15:00,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:15:00,824 INFO L87 Difference]: Start difference. First operand 980 states and 2183 transitions. Second operand 7 states. [2019-12-18 13:15:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:01,182 INFO L93 Difference]: Finished difference Result 2829 states and 5891 transitions. [2019-12-18 13:15:01,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:15:01,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 13:15:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:01,188 INFO L225 Difference]: With dead ends: 2829 [2019-12-18 13:15:01,188 INFO L226 Difference]: Without dead ends: 1889 [2019-12-18 13:15:01,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:15:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-12-18 13:15:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1018. [2019-12-18 13:15:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-12-18 13:15:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2242 transitions. [2019-12-18 13:15:01,213 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2242 transitions. Word has length 51 [2019-12-18 13:15:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:01,214 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 2242 transitions. [2019-12-18 13:15:01,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:15:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2242 transitions. [2019-12-18 13:15:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:15:01,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:01,217 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] [2019-12-18 13:15:01,217 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1598138544, now seen corresponding path program 2 times [2019-12-18 13:15:01,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:01,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475417219] [2019-12-18 13:15:01,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:15:01,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475417219] [2019-12-18 13:15:01,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:01,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:15:01,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094248944] [2019-12-18 13:15:01,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:15:01,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:15:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:15:01,291 INFO L87 Difference]: Start difference. First operand 1018 states and 2242 transitions. Second operand 5 states. [2019-12-18 13:15:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:01,503 INFO L93 Difference]: Finished difference Result 1155 states and 2492 transitions. [2019-12-18 13:15:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:15:01,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 13:15:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:01,506 INFO L225 Difference]: With dead ends: 1155 [2019-12-18 13:15:01,506 INFO L226 Difference]: Without dead ends: 1155 [2019-12-18 13:15:01,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:15:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-12-18 13:15:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1067. [2019-12-18 13:15:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-12-18 13:15:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 2339 transitions. [2019-12-18 13:15:01,525 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 2339 transitions. Word has length 51 [2019-12-18 13:15:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:01,526 INFO L462 AbstractCegarLoop]: Abstraction has 1067 states and 2339 transitions. [2019-12-18 13:15:01,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:15:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 2339 transitions. [2019-12-18 13:15:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:15:01,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:01,529 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] [2019-12-18 13:15:01,529 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:01,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1838514274, now seen corresponding path program 3 times [2019-12-18 13:15:01,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:01,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960069433] [2019-12-18 13:15:01,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:15:01,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960069433] [2019-12-18 13:15:01,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:01,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:15:01,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86888274] [2019-12-18 13:15:01,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:15:01,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:15:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:15:01,668 INFO L87 Difference]: Start difference. First operand 1067 states and 2339 transitions. Second operand 3 states. [2019-12-18 13:15:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:01,685 INFO L93 Difference]: Finished difference Result 1066 states and 2337 transitions. [2019-12-18 13:15:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:15:01,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 13:15:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:01,689 INFO L225 Difference]: With dead ends: 1066 [2019-12-18 13:15:01,689 INFO L226 Difference]: Without dead ends: 1066 [2019-12-18 13:15:01,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:15:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-12-18 13:15:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 951. [2019-12-18 13:15:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-18 13:15:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2126 transitions. [2019-12-18 13:15:01,706 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2126 transitions. Word has length 51 [2019-12-18 13:15:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:01,706 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2126 transitions. [2019-12-18 13:15:01,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:15:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2126 transitions. [2019-12-18 13:15:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:15:01,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:01,709 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] [2019-12-18 13:15:01,709 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash 505389010, now seen corresponding path program 1 times [2019-12-18 13:15:01,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:01,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479948181] [2019-12-18 13:15:01,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:15:01,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479948181] [2019-12-18 13:15:01,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:01,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:15:01,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392479270] [2019-12-18 13:15:01,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:15:01,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:01,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:15:01,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:15:01,849 INFO L87 Difference]: Start difference. First operand 951 states and 2126 transitions. Second operand 8 states. [2019-12-18 13:15:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:02,400 INFO L93 Difference]: Finished difference Result 1278 states and 2682 transitions. [2019-12-18 13:15:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:15:02,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 13:15:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:02,405 INFO L225 Difference]: With dead ends: 1278 [2019-12-18 13:15:02,405 INFO L226 Difference]: Without dead ends: 1278 [2019-12-18 13:15:02,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:15:02,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-12-18 13:15:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 752. [2019-12-18 13:15:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-12-18 13:15:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1608 transitions. [2019-12-18 13:15:02,422 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1608 transitions. Word has length 52 [2019-12-18 13:15:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:02,422 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1608 transitions. [2019-12-18 13:15:02,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:15:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1608 transitions. [2019-12-18 13:15:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:15:02,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:02,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] [2019-12-18 13:15:02,425 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1643675972, now seen corresponding path program 2 times [2019-12-18 13:15:02,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:02,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339080124] [2019-12-18 13:15:02,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:15:02,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339080124] [2019-12-18 13:15:02,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:02,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:15:02,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343088612] [2019-12-18 13:15:02,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:15:02,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:02,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:15:02,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:02,518 INFO L87 Difference]: Start difference. First operand 752 states and 1608 transitions. Second operand 4 states. [2019-12-18 13:15:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:02,570 INFO L93 Difference]: Finished difference Result 916 states and 1920 transitions. [2019-12-18 13:15:02,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:15:02,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 13:15:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:02,572 INFO L225 Difference]: With dead ends: 916 [2019-12-18 13:15:02,572 INFO L226 Difference]: Without dead ends: 916 [2019-12-18 13:15:02,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2019-12-18 13:15:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 760. [2019-12-18 13:15:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-12-18 13:15:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1618 transitions. [2019-12-18 13:15:02,586 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1618 transitions. Word has length 52 [2019-12-18 13:15:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:02,586 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1618 transitions. [2019-12-18 13:15:02,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:15:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1618 transitions. [2019-12-18 13:15:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:15:02,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:02,588 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] [2019-12-18 13:15:02,589 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:02,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-18 13:15:02,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:02,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204409232] [2019-12-18 13:15:02,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:15:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:15:02,703 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:15:02,704 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:15:02,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= (store .cse0 |v_ULTIMATE.start_main_~#t837~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$w_buff1~0_316) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t837~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t837~0.base_35|) |v_ULTIMATE.start_main_~#t837~0.offset_23| 0))) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= 0 |v_ULTIMATE.start_main_~#t837~0.offset_23|) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t837~0.base_35|)) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t837~0.base_35| 4)) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= 0 v_~a$r_buff0_thd1~0_236) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t837~0.base_35|) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_16|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_27|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ULTIMATE.start_main_~#t837~0.base=|v_ULTIMATE.start_main_~#t837~0.base_35|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_~#t837~0.offset=|v_ULTIMATE.start_main_~#t837~0.offset_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ULTIMATE.start_main_~#t838~0.offset, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t838~0.base, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t837~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t837~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:15:02,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff0~0_In1980452472 ~a$w_buff1~0_Out1980452472) (= |P0Thread1of1ForFork0_#in~arg.base_In1980452472| P0Thread1of1ForFork0_~arg.base_Out1980452472) (= P0Thread1of1ForFork0_~arg.offset_Out1980452472 |P0Thread1of1ForFork0_#in~arg.offset_In1980452472|) (= ~a$w_buff0_used~0_Out1980452472 1) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1980452472|) (= ~a$w_buff0_used~0_In1980452472 ~a$w_buff1_used~0_Out1980452472) (= (mod ~a$w_buff1_used~0_Out1980452472 256) 0) (= ~a$w_buff0~0_Out1980452472 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1980452472| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1980452472)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1980452472|, ~a$w_buff0~0=~a$w_buff0~0_In1980452472, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1980452472|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1980452472} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1980452472|, ~a$w_buff1~0=~a$w_buff1~0_Out1980452472, ~a$w_buff0~0=~a$w_buff0~0_Out1980452472, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1980452472, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1980452472|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out1980452472, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out1980452472, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1980452472, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1980452472|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1980452472} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:15:02,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t838~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t838~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t838~0.offset_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10|) |v_ULTIMATE.start_main_~#t838~0.offset_9| 1)) |v_#memory_int_7|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t838~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t838~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t838~0.base] because there is no mapped edge [2019-12-18 13:15:02,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-467225874 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-467225874 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-467225874 256)) (and .cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-467225874 256))) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In-467225874 256))))) (= |P1Thread1of1ForFork1_#t~ite23_Out-467225874| |P1Thread1of1ForFork1_#t~ite24_Out-467225874|) (= ~a$w_buff1_used~0_In-467225874 |P1Thread1of1ForFork1_#t~ite23_Out-467225874|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In-467225874| |P1Thread1of1ForFork1_#t~ite23_Out-467225874|) (= ~a$w_buff1_used~0_In-467225874 |P1Thread1of1ForFork1_#t~ite24_Out-467225874|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-467225874, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-467225874, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-467225874|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-467225874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-467225874, ~weak$$choice2~0=~weak$$choice2~0_In-467225874} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-467225874, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-467225874|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-467225874, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-467225874|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-467225874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-467225874, ~weak$$choice2~0=~weak$$choice2~0_In-467225874} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-18 13:15:02,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_12|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 13:15:02,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1313786546 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1313786546 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1313786546| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1313786546| ~a$w_buff0_used~0_In1313786546)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1313786546, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1313786546} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1313786546|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1313786546, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1313786546} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:15:02,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In46798783 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In46798783 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In46798783 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In46798783 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out46798783|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In46798783 |P0Thread1of1ForFork0_#t~ite6_Out46798783|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In46798783, ~a$w_buff0_used~0=~a$w_buff0_used~0_In46798783, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In46798783, ~a$w_buff1_used~0=~a$w_buff1_used~0_In46798783} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out46798783|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In46798783, ~a$w_buff0_used~0=~a$w_buff0_used~0_In46798783, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In46798783, ~a$w_buff1_used~0=~a$w_buff1_used~0_In46798783} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:15:02,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1427500718 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1427500718 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1427500718 ~a$r_buff0_thd1~0_Out-1427500718)) (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1427500718 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1427500718, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1427500718} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1427500718|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1427500718, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1427500718} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:15:02,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In1976455769 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1976455769 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In1976455769 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1976455769 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In1976455769 |P0Thread1of1ForFork0_#t~ite8_Out1976455769|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1976455769|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1976455769, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1976455769, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1976455769, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1976455769} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1976455769, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1976455769|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1976455769, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1976455769, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1976455769} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:15:02,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:15:02,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_13|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 13:15:02,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In1558409642 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1558409642 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1558409642| |P1Thread1of1ForFork1_#t~ite33_Out1558409642|))) (or (and (= ~a$w_buff1~0_In1558409642 |P1Thread1of1ForFork1_#t~ite32_Out1558409642|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1558409642| ~a~0_In1558409642) .cse2))) InVars {~a~0=~a~0_In1558409642, ~a$w_buff1~0=~a$w_buff1~0_In1558409642, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1558409642, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1558409642} OutVars{~a~0=~a~0_In1558409642, ~a$w_buff1~0=~a$w_buff1~0_In1558409642, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1558409642, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1558409642|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1558409642|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1558409642} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 13:15:02,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In732116054 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In732116054 256)))) (or (and (= ~a$w_buff0_used~0_In732116054 |P1Thread1of1ForFork1_#t~ite34_Out732116054|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out732116054|) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In732116054, ~a$w_buff0_used~0=~a$w_buff0_used~0_In732116054} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out732116054|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In732116054, ~a$w_buff0_used~0=~a$w_buff0_used~0_In732116054} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:15:02,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1406799135 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1406799135 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1406799135 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1406799135 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-1406799135| ~a$w_buff1_used~0_In-1406799135) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1406799135|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1406799135, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1406799135, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1406799135, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1406799135} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1406799135, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1406799135, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1406799135, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1406799135|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1406799135} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:15:02,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-2144853983 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-2144853983 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2144853983|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In-2144853983 |P1Thread1of1ForFork1_#t~ite36_Out-2144853983|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2144853983, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2144853983} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2144853983, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2144853983, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2144853983|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 13:15:02,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-527214224 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-527214224 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-527214224 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-527214224 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-527214224|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-527214224 |P1Thread1of1ForFork1_#t~ite37_Out-527214224|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-527214224, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-527214224, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-527214224, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-527214224} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-527214224, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-527214224, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-527214224, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-527214224, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-527214224|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:15:02,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~a$r_buff1_thd2~0_110) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:15:02,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 13:15:02,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-1684857332 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1684857332 256) 0))) (or (and (= ~a$w_buff1~0_In-1684857332 |ULTIMATE.start_main_#t~ite40_Out-1684857332|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a~0_In-1684857332 |ULTIMATE.start_main_#t~ite40_Out-1684857332|)))) InVars {~a~0=~a~0_In-1684857332, ~a$w_buff1~0=~a$w_buff1~0_In-1684857332, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1684857332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1684857332} OutVars{~a~0=~a~0_In-1684857332, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1684857332|, ~a$w_buff1~0=~a$w_buff1~0_In-1684857332, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1684857332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1684857332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:15:02,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:15:02,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1183446634 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1183446634 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1183446634| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1183446634 |ULTIMATE.start_main_#t~ite42_Out1183446634|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1183446634, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1183446634} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1183446634, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1183446634, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1183446634|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:15:02,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-2013847643 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2013847643 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-2013847643 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2013847643 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-2013847643|)) (and (= ~a$w_buff1_used~0_In-2013847643 |ULTIMATE.start_main_#t~ite43_Out-2013847643|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2013847643, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2013847643, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2013847643, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2013847643} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2013847643, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2013847643, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2013847643, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2013847643, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2013847643|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:15:02,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1476083075 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1476083075 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1476083075| ~a$r_buff0_thd0~0_In-1476083075)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1476083075| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1476083075, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1476083075} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1476083075, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1476083075, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1476083075|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:15:02,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1019238615 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1019238615 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1019238615 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1019238615 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1019238615| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1019238615| ~a$r_buff1_thd0~0_In1019238615)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1019238615, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1019238615, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1019238615, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1019238615} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1019238615, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1019238615, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1019238615, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1019238615, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1019238615|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:15:02,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:15:02,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:15:02 BasicIcfg [2019-12-18 13:15:02,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:15:02,823 INFO L168 Benchmark]: Toolchain (without parser) took 14466.89 ms. Allocated memory was 138.4 MB in the beginning and 438.8 MB in the end (delta: 300.4 MB). Free memory was 101.7 MB in the beginning and 76.9 MB in the end (delta: 24.8 MB). Peak memory consumption was 325.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:02,824 INFO L168 Benchmark]: CDTParser took 1.69 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:15:02,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.50 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.2 MB in the beginning and 154.0 MB in the end (delta: -52.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:02,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.44 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:02,826 INFO L168 Benchmark]: Boogie Preprocessor took 38.57 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:02,827 INFO L168 Benchmark]: RCFGBuilder took 786.43 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 103.9 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:02,827 INFO L168 Benchmark]: TraceAbstraction took 12818.60 ms. Allocated memory was 201.9 MB in the beginning and 438.8 MB in the end (delta: 237.0 MB). Free memory was 103.3 MB in the beginning and 76.9 MB in the end (delta: 26.4 MB). Peak memory consumption was 263.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:02,832 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.69 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.50 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.2 MB in the beginning and 154.0 MB in the end (delta: -52.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.44 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.57 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.43 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 103.9 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12818.60 ms. Allocated memory was 201.9 MB in the beginning and 438.8 MB in the end (delta: 237.0 MB). Free memory was 103.3 MB in the beginning and 76.9 MB in the end (delta: 26.4 MB). Peak memory consumption was 263.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t837, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t838, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$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, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1979 SDtfs, 1853 SDslu, 3412 SDs, 0 SdLazy, 1941 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 3194 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 82189 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...