/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:00:34,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:00:34,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:00:34,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:00:34,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:00:34,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:00:34,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:00:34,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:00:34,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:00:34,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:00:34,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:00:34,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:00:34,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:00:34,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:00:34,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:00:34,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:00:34,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:00:34,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:00:35,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:00:35,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:00:35,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:00:35,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:00:35,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:00:35,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:00:35,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:00:35,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:00:35,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:00:35,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:00:35,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:00:35,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:00:35,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:00:35,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:00:35,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:00:35,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:00:35,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:00:35,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:00:35,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:00:35,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:00:35,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:00:35,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:00:35,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:00:35,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 02:00:35,031 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:00:35,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:00:35,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:00:35,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:00:35,033 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:00:35,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:00:35,033 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:00:35,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:00:35,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:00:35,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:00:35,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:00:35,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:00:35,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:00:35,034 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:00:35,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:00:35,035 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:00:35,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:00:35,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:00:35,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:00:35,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:00:35,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:00:35,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:00:35,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:00:35,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:00:35,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:00:35,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:00:35,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:00:35,039 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:00:35,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:00:35,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:00:35,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:00:35,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:00:35,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:00:35,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:00:35,343 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:00:35,344 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-19 02:00:35,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3447377b0/90a9a9b0d6404c6cb60039164ed749b1/FLAG22ed0e92f [2019-12-19 02:00:36,008 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:00:36,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-19 02:00:36,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3447377b0/90a9a9b0d6404c6cb60039164ed749b1/FLAG22ed0e92f [2019-12-19 02:00:36,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3447377b0/90a9a9b0d6404c6cb60039164ed749b1 [2019-12-19 02:00:36,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:00:36,286 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:00:36,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:00:36,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:00:36,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:00:36,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:00:36" (1/1) ... [2019-12-19 02:00:36,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c2c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:36, skipping insertion in model container [2019-12-19 02:00:36,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:00:36" (1/1) ... [2019-12-19 02:00:36,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:00:36,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:00:36,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:00:36,906 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:00:36,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:00:37,064 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:00:37,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37 WrapperNode [2019-12-19 02:00:37,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:00:37,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:00:37,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:00:37,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:00:37,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (1/1) ... [2019-12-19 02:00:37,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (1/1) ... [2019-12-19 02:00:37,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:00:37,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:00:37,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:00:37,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:00:37,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (1/1) ... [2019-12-19 02:00:37,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (1/1) ... [2019-12-19 02:00:37,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (1/1) ... [2019-12-19 02:00:37,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (1/1) ... [2019-12-19 02:00:37,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (1/1) ... [2019-12-19 02:00:37,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (1/1) ... [2019-12-19 02:00:37,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (1/1) ... [2019-12-19 02:00:37,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:00:37,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:00:37,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:00:37,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:00:37,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (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-19 02:00:37,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:00:37,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:00:37,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:00:37,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:00:37,241 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:00:37,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:00:37,242 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:00:37,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:00:37,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:00:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:00:37,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:00:37,246 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 02:00:38,001 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:00:38,001 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:00:38,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:00:38 BoogieIcfgContainer [2019-12-19 02:00:38,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:00:38,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:00:38,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:00:38,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:00:38,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:00:36" (1/3) ... [2019-12-19 02:00:38,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f7f2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:00:38, skipping insertion in model container [2019-12-19 02:00:38,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:37" (2/3) ... [2019-12-19 02:00:38,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f7f2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:00:38, skipping insertion in model container [2019-12-19 02:00:38,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:00:38" (3/3) ... [2019-12-19 02:00:38,017 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc.i [2019-12-19 02:00:38,030 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:00:38,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:00:38,046 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:00:38,047 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:00:38,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,086 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,086 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,086 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,087 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,088 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,149 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,159 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,161 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:38,179 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:00:38,198 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:00:38,198 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:00:38,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:00:38,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:00:38,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:00:38,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:00:38,199 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:00:38,199 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:00:38,214 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 185 transitions [2019-12-19 02:00:40,082 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32595 states. [2019-12-19 02:00:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 32595 states. [2019-12-19 02:00:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-19 02:00:40,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:40,094 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] [2019-12-19 02:00:40,095 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:40,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1631155360, now seen corresponding path program 1 times [2019-12-19 02:00:40,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:40,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350078161] [2019-12-19 02:00:40,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:40,439 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-19 02:00:40,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350078161] [2019-12-19 02:00:40,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:40,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:40,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461068953] [2019-12-19 02:00:40,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:40,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:40,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:40,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:40,467 INFO L87 Difference]: Start difference. First operand 32595 states. Second operand 4 states. [2019-12-19 02:00:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:42,030 INFO L93 Difference]: Finished difference Result 33595 states and 129572 transitions. [2019-12-19 02:00:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:00:42,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-19 02:00:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:42,299 INFO L225 Difference]: With dead ends: 33595 [2019-12-19 02:00:42,299 INFO L226 Difference]: Without dead ends: 25707 [2019-12-19 02:00:42,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25707 states. [2019-12-19 02:00:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25707 to 25707. [2019-12-19 02:00:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25707 states. [2019-12-19 02:00:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25707 states to 25707 states and 99588 transitions. [2019-12-19 02:00:43,921 INFO L78 Accepts]: Start accepts. Automaton has 25707 states and 99588 transitions. Word has length 38 [2019-12-19 02:00:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:43,922 INFO L462 AbstractCegarLoop]: Abstraction has 25707 states and 99588 transitions. [2019-12-19 02:00:43,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 25707 states and 99588 transitions. [2019-12-19 02:00:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 02:00:43,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:43,931 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] [2019-12-19 02:00:43,932 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash 475633161, now seen corresponding path program 1 times [2019-12-19 02:00:43,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:43,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152463676] [2019-12-19 02:00:43,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:44,040 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-19 02:00:44,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152463676] [2019-12-19 02:00:44,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:44,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:44,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768674171] [2019-12-19 02:00:44,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:44,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:44,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:44,044 INFO L87 Difference]: Start difference. First operand 25707 states and 99588 transitions. Second operand 5 states. [2019-12-19 02:00:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:45,250 INFO L93 Difference]: Finished difference Result 41085 states and 150435 transitions. [2019-12-19 02:00:45,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:45,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-19 02:00:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:45,441 INFO L225 Difference]: With dead ends: 41085 [2019-12-19 02:00:45,441 INFO L226 Difference]: Without dead ends: 40549 [2019-12-19 02:00:45,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2019-12-19 02:00:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 38929. [2019-12-19 02:00:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38929 states. [2019-12-19 02:00:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38929 states to 38929 states and 143585 transitions. [2019-12-19 02:00:48,067 INFO L78 Accepts]: Start accepts. Automaton has 38929 states and 143585 transitions. Word has length 50 [2019-12-19 02:00:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:48,068 INFO L462 AbstractCegarLoop]: Abstraction has 38929 states and 143585 transitions. [2019-12-19 02:00:48,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 38929 states and 143585 transitions. [2019-12-19 02:00:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 02:00:48,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:48,075 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-19 02:00:48,075 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:48,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1647317549, now seen corresponding path program 1 times [2019-12-19 02:00:48,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:48,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985121008] [2019-12-19 02:00:48,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:48,190 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-19 02:00:48,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985121008] [2019-12-19 02:00:48,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:48,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:48,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889705469] [2019-12-19 02:00:48,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:48,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:48,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:48,193 INFO L87 Difference]: Start difference. First operand 38929 states and 143585 transitions. Second operand 5 states. [2019-12-19 02:00:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:49,131 INFO L93 Difference]: Finished difference Result 49782 states and 180637 transitions. [2019-12-19 02:00:49,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:49,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-19 02:00:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:49,341 INFO L225 Difference]: With dead ends: 49782 [2019-12-19 02:00:49,341 INFO L226 Difference]: Without dead ends: 49278 [2019-12-19 02:00:49,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:49,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49278 states. [2019-12-19 02:00:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49278 to 42681. [2019-12-19 02:00:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42681 states. [2019-12-19 02:00:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42681 states to 42681 states and 156596 transitions. [2019-12-19 02:00:52,219 INFO L78 Accepts]: Start accepts. Automaton has 42681 states and 156596 transitions. Word has length 51 [2019-12-19 02:00:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:52,220 INFO L462 AbstractCegarLoop]: Abstraction has 42681 states and 156596 transitions. [2019-12-19 02:00:52,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 42681 states and 156596 transitions. [2019-12-19 02:00:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 02:00:52,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:52,229 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-19 02:00:52,230 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1552968967, now seen corresponding path program 1 times [2019-12-19 02:00:52,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:52,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450320001] [2019-12-19 02:00:52,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:52,302 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-19 02:00:52,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450320001] [2019-12-19 02:00:52,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:52,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:00:52,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440820139] [2019-12-19 02:00:52,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:00:52,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:00:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:52,305 INFO L87 Difference]: Start difference. First operand 42681 states and 156596 transitions. Second operand 3 states. [2019-12-19 02:00:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:52,936 INFO L93 Difference]: Finished difference Result 61091 states and 221434 transitions. [2019-12-19 02:00:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:00:52,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-19 02:00:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:53,187 INFO L225 Difference]: With dead ends: 61091 [2019-12-19 02:00:53,188 INFO L226 Difference]: Without dead ends: 61091 [2019-12-19 02:00:53,188 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-19 02:00:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61091 states. [2019-12-19 02:00:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61091 to 48020. [2019-12-19 02:00:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48020 states. [2019-12-19 02:00:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48020 states to 48020 states and 174183 transitions. [2019-12-19 02:00:56,123 INFO L78 Accepts]: Start accepts. Automaton has 48020 states and 174183 transitions. Word has length 53 [2019-12-19 02:00:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:56,123 INFO L462 AbstractCegarLoop]: Abstraction has 48020 states and 174183 transitions. [2019-12-19 02:00:56,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:00:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 48020 states and 174183 transitions. [2019-12-19 02:00:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:56,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:56,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:56,139 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:56,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:56,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1347337287, now seen corresponding path program 1 times [2019-12-19 02:00:56,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:56,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9491459] [2019-12-19 02:00:56,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:56,282 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-19 02:00:56,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9491459] [2019-12-19 02:00:56,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:56,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:56,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479386603] [2019-12-19 02:00:56,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:56,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:56,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:56,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:56,284 INFO L87 Difference]: Start difference. First operand 48020 states and 174183 transitions. Second operand 6 states. [2019-12-19 02:00:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:57,579 INFO L93 Difference]: Finished difference Result 63760 states and 229383 transitions. [2019-12-19 02:00:57,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:57,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-19 02:00:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:57,801 INFO L225 Difference]: With dead ends: 63760 [2019-12-19 02:00:57,802 INFO L226 Difference]: Without dead ends: 63760 [2019-12-19 02:00:57,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63760 states. [2019-12-19 02:01:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63760 to 59953. [2019-12-19 02:01:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59953 states. [2019-12-19 02:01:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59953 states to 59953 states and 215676 transitions. [2019-12-19 02:01:00,961 INFO L78 Accepts]: Start accepts. Automaton has 59953 states and 215676 transitions. Word has length 57 [2019-12-19 02:01:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:00,961 INFO L462 AbstractCegarLoop]: Abstraction has 59953 states and 215676 transitions. [2019-12-19 02:01:00,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 59953 states and 215676 transitions. [2019-12-19 02:01:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:01:00,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:00,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:00,981 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1150678650, now seen corresponding path program 1 times [2019-12-19 02:01:00,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:00,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623735234] [2019-12-19 02:01:00,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:01,090 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-19 02:01:01,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623735234] [2019-12-19 02:01:01,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:01,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:01,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165823127] [2019-12-19 02:01:01,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:01,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:01,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:01,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:01,092 INFO L87 Difference]: Start difference. First operand 59953 states and 215676 transitions. Second operand 7 states. [2019-12-19 02:01:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:02,493 INFO L93 Difference]: Finished difference Result 83689 states and 290101 transitions. [2019-12-19 02:01:02,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:01:02,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-19 02:01:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:03,247 INFO L225 Difference]: With dead ends: 83689 [2019-12-19 02:01:03,247 INFO L226 Difference]: Without dead ends: 83689 [2019-12-19 02:01:03,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:01:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83689 states. [2019-12-19 02:01:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83689 to 71016. [2019-12-19 02:01:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71016 states. [2019-12-19 02:01:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71016 states to 71016 states and 249890 transitions. [2019-12-19 02:01:07,419 INFO L78 Accepts]: Start accepts. Automaton has 71016 states and 249890 transitions. Word has length 57 [2019-12-19 02:01:07,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:07,419 INFO L462 AbstractCegarLoop]: Abstraction has 71016 states and 249890 transitions. [2019-12-19 02:01:07,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 71016 states and 249890 transitions. [2019-12-19 02:01:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:01:07,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:07,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:07,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2038182331, now seen corresponding path program 1 times [2019-12-19 02:01:07,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:07,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048492073] [2019-12-19 02:01:07,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:07,514 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-19 02:01:07,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048492073] [2019-12-19 02:01:07,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:07,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:01:07,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750846350] [2019-12-19 02:01:07,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:01:07,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:01:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:01:07,517 INFO L87 Difference]: Start difference. First operand 71016 states and 249890 transitions. Second operand 3 states. [2019-12-19 02:01:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:07,761 INFO L93 Difference]: Finished difference Result 54025 states and 188922 transitions. [2019-12-19 02:01:07,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:01:07,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-19 02:01:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:07,892 INFO L225 Difference]: With dead ends: 54025 [2019-12-19 02:01:07,892 INFO L226 Difference]: Without dead ends: 54025 [2019-12-19 02:01:07,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:01:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54025 states. [2019-12-19 02:01:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54025 to 53410. [2019-12-19 02:01:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53410 states. [2019-12-19 02:01:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53410 states to 53410 states and 187041 transitions. [2019-12-19 02:01:09,298 INFO L78 Accepts]: Start accepts. Automaton has 53410 states and 187041 transitions. Word has length 57 [2019-12-19 02:01:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:09,299 INFO L462 AbstractCegarLoop]: Abstraction has 53410 states and 187041 transitions. [2019-12-19 02:01:09,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:01:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 53410 states and 187041 transitions. [2019-12-19 02:01:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:01:09,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:09,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:09,308 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:09,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:09,308 INFO L82 PathProgramCache]: Analyzing trace with hash -565356220, now seen corresponding path program 1 times [2019-12-19 02:01:09,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:09,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127157962] [2019-12-19 02:01:09,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:09,401 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-19 02:01:09,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127157962] [2019-12-19 02:01:09,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:09,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:01:09,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847361366] [2019-12-19 02:01:09,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:01:09,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:09,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:01:09,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:09,403 INFO L87 Difference]: Start difference. First operand 53410 states and 187041 transitions. Second operand 6 states. [2019-12-19 02:01:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:10,147 INFO L93 Difference]: Finished difference Result 68650 states and 237305 transitions. [2019-12-19 02:01:10,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:01:10,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-19 02:01:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:10,287 INFO L225 Difference]: With dead ends: 68650 [2019-12-19 02:01:10,287 INFO L226 Difference]: Without dead ends: 68082 [2019-12-19 02:01:10,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 02:01:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68082 states. [2019-12-19 02:01:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68082 to 53494. [2019-12-19 02:01:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53494 states. [2019-12-19 02:01:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53494 states to 53494 states and 187738 transitions. [2019-12-19 02:01:12,030 INFO L78 Accepts]: Start accepts. Automaton has 53494 states and 187738 transitions. Word has length 57 [2019-12-19 02:01:12,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:12,030 INFO L462 AbstractCegarLoop]: Abstraction has 53494 states and 187738 transitions. [2019-12-19 02:01:12,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 53494 states and 187738 transitions. [2019-12-19 02:01:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 02:01:12,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:12,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:12,042 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1699947683, now seen corresponding path program 1 times [2019-12-19 02:01:12,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:12,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926136899] [2019-12-19 02:01:12,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:12,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-19 02:01:12,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926136899] [2019-12-19 02:01:12,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:12,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:01:12,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544509586] [2019-12-19 02:01:12,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:01:12,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:12,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:01:12,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:12,137 INFO L87 Difference]: Start difference. First operand 53494 states and 187738 transitions. Second operand 6 states. [2019-12-19 02:01:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:13,006 INFO L93 Difference]: Finished difference Result 67853 states and 231364 transitions. [2019-12-19 02:01:13,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:13,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-19 02:01:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:13,135 INFO L225 Difference]: With dead ends: 67853 [2019-12-19 02:01:13,135 INFO L226 Difference]: Without dead ends: 67853 [2019-12-19 02:01:13,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67853 states. [2019-12-19 02:01:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67853 to 59085. [2019-12-19 02:01:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59085 states. [2019-12-19 02:01:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59085 states to 59085 states and 204134 transitions. [2019-12-19 02:01:16,549 INFO L78 Accepts]: Start accepts. Automaton has 59085 states and 204134 transitions. Word has length 58 [2019-12-19 02:01:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:16,549 INFO L462 AbstractCegarLoop]: Abstraction has 59085 states and 204134 transitions. [2019-12-19 02:01:16,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 59085 states and 204134 transitions. [2019-12-19 02:01:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 02:01:16,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:16,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:16,559 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash -812444002, now seen corresponding path program 1 times [2019-12-19 02:01:16,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:16,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305539616] [2019-12-19 02:01:16,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:16,636 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-19 02:01:16,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305539616] [2019-12-19 02:01:16,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:16,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:01:16,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161109511] [2019-12-19 02:01:16,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:01:16,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:16,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:01:16,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:01:16,639 INFO L87 Difference]: Start difference. First operand 59085 states and 204134 transitions. Second operand 4 states. [2019-12-19 02:01:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:16,697 INFO L93 Difference]: Finished difference Result 10216 states and 31250 transitions. [2019-12-19 02:01:16,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:01:16,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-19 02:01:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:16,713 INFO L225 Difference]: With dead ends: 10216 [2019-12-19 02:01:16,713 INFO L226 Difference]: Without dead ends: 8511 [2019-12-19 02:01:16,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 02:01:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8511 states. [2019-12-19 02:01:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8511 to 8463. [2019-12-19 02:01:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8463 states. [2019-12-19 02:01:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 25329 transitions. [2019-12-19 02:01:16,816 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 25329 transitions. Word has length 58 [2019-12-19 02:01:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:16,816 INFO L462 AbstractCegarLoop]: Abstraction has 8463 states and 25329 transitions. [2019-12-19 02:01:16,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:01:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 25329 transitions. [2019-12-19 02:01:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:01:16,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:16,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:16,821 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1292079072, now seen corresponding path program 1 times [2019-12-19 02:01:16,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:16,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406349561] [2019-12-19 02:01:16,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:16,890 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-19 02:01:16,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406349561] [2019-12-19 02:01:16,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:16,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:01:16,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656411556] [2019-12-19 02:01:16,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:01:16,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:16,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:01:16,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:01:16,892 INFO L87 Difference]: Start difference. First operand 8463 states and 25329 transitions. Second operand 4 states. [2019-12-19 02:01:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:17,021 INFO L93 Difference]: Finished difference Result 9710 states and 29108 transitions. [2019-12-19 02:01:17,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:01:17,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 02:01:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:17,442 INFO L225 Difference]: With dead ends: 9710 [2019-12-19 02:01:17,442 INFO L226 Difference]: Without dead ends: 9710 [2019-12-19 02:01:17,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 02:01:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9710 states. [2019-12-19 02:01:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9710 to 8883. [2019-12-19 02:01:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2019-12-19 02:01:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 26592 transitions. [2019-12-19 02:01:17,615 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 26592 transitions. Word has length 65 [2019-12-19 02:01:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:17,616 INFO L462 AbstractCegarLoop]: Abstraction has 8883 states and 26592 transitions. [2019-12-19 02:01:17,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:01:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 26592 transitions. [2019-12-19 02:01:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:01:17,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:17,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:17,622 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:17,622 INFO L82 PathProgramCache]: Analyzing trace with hash 450731263, now seen corresponding path program 1 times [2019-12-19 02:01:17,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:17,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877267618] [2019-12-19 02:01:17,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:17,702 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-19 02:01:17,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877267618] [2019-12-19 02:01:17,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:17,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:01:17,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185127662] [2019-12-19 02:01:17,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:01:17,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:17,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:01:17,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:17,705 INFO L87 Difference]: Start difference. First operand 8883 states and 26592 transitions. Second operand 6 states. [2019-12-19 02:01:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:18,160 INFO L93 Difference]: Finished difference Result 11199 states and 33079 transitions. [2019-12-19 02:01:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:01:18,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 02:01:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:18,179 INFO L225 Difference]: With dead ends: 11199 [2019-12-19 02:01:18,179 INFO L226 Difference]: Without dead ends: 11138 [2019-12-19 02:01:18,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:01:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-19 02:01:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10414. [2019-12-19 02:01:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-19 02:01:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 30946 transitions. [2019-12-19 02:01:18,321 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 30946 transitions. Word has length 65 [2019-12-19 02:01:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:18,321 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 30946 transitions. [2019-12-19 02:01:18,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 30946 transitions. [2019-12-19 02:01:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:01:18,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:18,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:18,326 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1715256149, now seen corresponding path program 1 times [2019-12-19 02:01:18,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:18,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537705657] [2019-12-19 02:01:18,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:18,382 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-19 02:01:18,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537705657] [2019-12-19 02:01:18,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:18,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:01:18,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947804818] [2019-12-19 02:01:18,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:01:18,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:18,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:01:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:01:18,385 INFO L87 Difference]: Start difference. First operand 10414 states and 30946 transitions. Second operand 4 states. [2019-12-19 02:01:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:18,653 INFO L93 Difference]: Finished difference Result 13387 states and 39337 transitions. [2019-12-19 02:01:18,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:01:18,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-19 02:01:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:18,676 INFO L225 Difference]: With dead ends: 13387 [2019-12-19 02:01:18,676 INFO L226 Difference]: Without dead ends: 13387 [2019-12-19 02:01:18,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:01:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13387 states. [2019-12-19 02:01:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13387 to 11728. [2019-12-19 02:01:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11728 states. [2019-12-19 02:01:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11728 states to 11728 states and 34581 transitions. [2019-12-19 02:01:18,829 INFO L78 Accepts]: Start accepts. Automaton has 11728 states and 34581 transitions. Word has length 71 [2019-12-19 02:01:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:18,829 INFO L462 AbstractCegarLoop]: Abstraction has 11728 states and 34581 transitions. [2019-12-19 02:01:18,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:01:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 11728 states and 34581 transitions. [2019-12-19 02:01:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:01:18,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:18,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:18,837 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash -470491668, now seen corresponding path program 1 times [2019-12-19 02:01:18,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:18,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007136581] [2019-12-19 02:01:18,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:18,941 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-19 02:01:18,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007136581] [2019-12-19 02:01:18,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:18,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:01:18,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712082918] [2019-12-19 02:01:18,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:01:18,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:18,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:01:18,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:18,943 INFO L87 Difference]: Start difference. First operand 11728 states and 34581 transitions. Second operand 6 states. [2019-12-19 02:01:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:19,496 INFO L93 Difference]: Finished difference Result 12877 states and 37338 transitions. [2019-12-19 02:01:19,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:19,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:01:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:19,513 INFO L225 Difference]: With dead ends: 12877 [2019-12-19 02:01:19,513 INFO L226 Difference]: Without dead ends: 12877 [2019-12-19 02:01:19,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-19 02:01:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 12577. [2019-12-19 02:01:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12577 states. [2019-12-19 02:01:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12577 states to 12577 states and 36580 transitions. [2019-12-19 02:01:19,663 INFO L78 Accepts]: Start accepts. Automaton has 12577 states and 36580 transitions. Word has length 71 [2019-12-19 02:01:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:19,663 INFO L462 AbstractCegarLoop]: Abstraction has 12577 states and 36580 transitions. [2019-12-19 02:01:19,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 12577 states and 36580 transitions. [2019-12-19 02:01:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:01:19,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:19,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:19,671 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1747266285, now seen corresponding path program 1 times [2019-12-19 02:01:19,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:19,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675067662] [2019-12-19 02:01:19,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:19,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-19 02:01:19,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675067662] [2019-12-19 02:01:19,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:19,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:01:19,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457655470] [2019-12-19 02:01:19,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:01:19,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:19,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:01:19,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:19,753 INFO L87 Difference]: Start difference. First operand 12577 states and 36580 transitions. Second operand 6 states. [2019-12-19 02:01:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:20,264 INFO L93 Difference]: Finished difference Result 14466 states and 40828 transitions. [2019-12-19 02:01:20,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:01:20,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:01:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:20,283 INFO L225 Difference]: With dead ends: 14466 [2019-12-19 02:01:20,283 INFO L226 Difference]: Without dead ends: 14466 [2019-12-19 02:01:20,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:01:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2019-12-19 02:01:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 13140. [2019-12-19 02:01:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13140 states. [2019-12-19 02:01:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13140 states to 13140 states and 37549 transitions. [2019-12-19 02:01:20,822 INFO L78 Accepts]: Start accepts. Automaton has 13140 states and 37549 transitions. Word has length 71 [2019-12-19 02:01:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:20,822 INFO L462 AbstractCegarLoop]: Abstraction has 13140 states and 37549 transitions. [2019-12-19 02:01:20,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13140 states and 37549 transitions. [2019-12-19 02:01:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:01:20,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:20,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:20,831 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:20,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:20,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1958617198, now seen corresponding path program 1 times [2019-12-19 02:01:20,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:20,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824525296] [2019-12-19 02:01:20,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:01:20,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824525296] [2019-12-19 02:01:20,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:20,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:01:20,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402034232] [2019-12-19 02:01:20,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:01:20,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:20,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:01:20,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:01:20,905 INFO L87 Difference]: Start difference. First operand 13140 states and 37549 transitions. Second operand 5 states. [2019-12-19 02:01:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:21,273 INFO L93 Difference]: Finished difference Result 16966 states and 48261 transitions. [2019-12-19 02:01:21,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:01:21,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 02:01:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:21,302 INFO L225 Difference]: With dead ends: 16966 [2019-12-19 02:01:21,302 INFO L226 Difference]: Without dead ends: 16966 [2019-12-19 02:01:21,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16966 states. [2019-12-19 02:01:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16966 to 15670. [2019-12-19 02:01:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15670 states. [2019-12-19 02:01:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15670 states to 15670 states and 44446 transitions. [2019-12-19 02:01:21,595 INFO L78 Accepts]: Start accepts. Automaton has 15670 states and 44446 transitions. Word has length 71 [2019-12-19 02:01:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:21,596 INFO L462 AbstractCegarLoop]: Abstraction has 15670 states and 44446 transitions. [2019-12-19 02:01:21,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:01:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 15670 states and 44446 transitions. [2019-12-19 02:01:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:01:21,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:21,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:21,607 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:21,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1448083021, now seen corresponding path program 1 times [2019-12-19 02:01:21,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:21,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531045287] [2019-12-19 02:01:21,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:01:21,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531045287] [2019-12-19 02:01:21,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:21,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:01:21,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606902186] [2019-12-19 02:01:21,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:01:21,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:01:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:21,718 INFO L87 Difference]: Start difference. First operand 15670 states and 44446 transitions. Second operand 6 states. [2019-12-19 02:01:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:21,854 INFO L93 Difference]: Finished difference Result 16084 states and 44227 transitions. [2019-12-19 02:01:21,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:01:21,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:01:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:21,874 INFO L225 Difference]: With dead ends: 16084 [2019-12-19 02:01:21,874 INFO L226 Difference]: Without dead ends: 16084 [2019-12-19 02:01:21,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2019-12-19 02:01:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 14714. [2019-12-19 02:01:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14714 states. [2019-12-19 02:01:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14714 states to 14714 states and 40522 transitions. [2019-12-19 02:01:22,052 INFO L78 Accepts]: Start accepts. Automaton has 14714 states and 40522 transitions. Word has length 71 [2019-12-19 02:01:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:22,052 INFO L462 AbstractCegarLoop]: Abstraction has 14714 states and 40522 transitions. [2019-12-19 02:01:22,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 14714 states and 40522 transitions. [2019-12-19 02:01:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:01:22,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:22,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:22,059 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash 538635343, now seen corresponding path program 1 times [2019-12-19 02:01:22,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:22,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691564105] [2019-12-19 02:01:22,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:22,125 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-19 02:01:22,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691564105] [2019-12-19 02:01:22,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:22,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:01:22,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404738441] [2019-12-19 02:01:22,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:01:22,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:22,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:01:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:01:22,128 INFO L87 Difference]: Start difference. First operand 14714 states and 40522 transitions. Second operand 5 states. [2019-12-19 02:01:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:22,182 INFO L93 Difference]: Finished difference Result 5315 states and 12566 transitions. [2019-12-19 02:01:22,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:01:22,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 02:01:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:22,189 INFO L225 Difference]: With dead ends: 5315 [2019-12-19 02:01:22,189 INFO L226 Difference]: Without dead ends: 4643 [2019-12-19 02:01:22,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2019-12-19 02:01:22,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 4541. [2019-12-19 02:01:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-12-19 02:01:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 10384 transitions. [2019-12-19 02:01:22,256 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 10384 transitions. Word has length 71 [2019-12-19 02:01:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:22,256 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 10384 transitions. [2019-12-19 02:01:22,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:01:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 10384 transitions. [2019-12-19 02:01:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:01:22,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:22,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:22,262 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1679970640, now seen corresponding path program 1 times [2019-12-19 02:01:22,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:22,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418499496] [2019-12-19 02:01:22,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:22,303 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-19 02:01:22,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418499496] [2019-12-19 02:01:22,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:22,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:01:22,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651916285] [2019-12-19 02:01:22,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:01:22,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:22,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:01:22,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:01:22,306 INFO L87 Difference]: Start difference. First operand 4541 states and 10384 transitions. Second operand 3 states. [2019-12-19 02:01:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:22,337 INFO L93 Difference]: Finished difference Result 5482 states and 12309 transitions. [2019-12-19 02:01:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:01:22,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-19 02:01:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:22,343 INFO L225 Difference]: With dead ends: 5482 [2019-12-19 02:01:22,343 INFO L226 Difference]: Without dead ends: 5482 [2019-12-19 02:01:22,344 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-19 02:01:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2019-12-19 02:01:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 4476. [2019-12-19 02:01:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4476 states. [2019-12-19 02:01:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 9946 transitions. [2019-12-19 02:01:22,389 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 9946 transitions. Word has length 71 [2019-12-19 02:01:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:22,390 INFO L462 AbstractCegarLoop]: Abstraction has 4476 states and 9946 transitions. [2019-12-19 02:01:22,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:01:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 9946 transitions. [2019-12-19 02:01:22,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:01:22,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:22,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:22,394 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:22,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:22,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1543631293, now seen corresponding path program 1 times [2019-12-19 02:01:22,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:22,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864201264] [2019-12-19 02:01:22,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:22,453 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-19 02:01:22,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864201264] [2019-12-19 02:01:22,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:22,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:01:22,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186382147] [2019-12-19 02:01:22,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:01:22,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:01:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:01:22,455 INFO L87 Difference]: Start difference. First operand 4476 states and 9946 transitions. Second operand 5 states. [2019-12-19 02:01:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:22,632 INFO L93 Difference]: Finished difference Result 5533 states and 12363 transitions. [2019-12-19 02:01:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:01:22,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-19 02:01:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:22,640 INFO L225 Difference]: With dead ends: 5533 [2019-12-19 02:01:22,640 INFO L226 Difference]: Without dead ends: 5533 [2019-12-19 02:01:22,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:01:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2019-12-19 02:01:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 4896. [2019-12-19 02:01:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4896 states. [2019-12-19 02:01:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10904 transitions. [2019-12-19 02:01:22,688 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10904 transitions. Word has length 77 [2019-12-19 02:01:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:22,688 INFO L462 AbstractCegarLoop]: Abstraction has 4896 states and 10904 transitions. [2019-12-19 02:01:22,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:01:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10904 transitions. [2019-12-19 02:01:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:01:22,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:22,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:22,694 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:22,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash 199179042, now seen corresponding path program 1 times [2019-12-19 02:01:22,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:22,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003911497] [2019-12-19 02:01:22,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:22,790 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-19 02:01:22,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003911497] [2019-12-19 02:01:22,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:22,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:22,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977366078] [2019-12-19 02:01:22,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:22,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:22,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:22,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:22,793 INFO L87 Difference]: Start difference. First operand 4896 states and 10904 transitions. Second operand 7 states. [2019-12-19 02:01:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:23,263 INFO L93 Difference]: Finished difference Result 5669 states and 12508 transitions. [2019-12-19 02:01:23,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:01:23,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-19 02:01:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:23,271 INFO L225 Difference]: With dead ends: 5669 [2019-12-19 02:01:23,271 INFO L226 Difference]: Without dead ends: 5616 [2019-12-19 02:01:23,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 02:01:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2019-12-19 02:01:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 4983. [2019-12-19 02:01:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2019-12-19 02:01:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 10993 transitions. [2019-12-19 02:01:23,320 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 10993 transitions. Word has length 77 [2019-12-19 02:01:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:23,320 INFO L462 AbstractCegarLoop]: Abstraction has 4983 states and 10993 transitions. [2019-12-19 02:01:23,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 10993 transitions. [2019-12-19 02:01:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:01:23,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:23,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:23,325 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:23,326 INFO L82 PathProgramCache]: Analyzing trace with hash -283880815, now seen corresponding path program 1 times [2019-12-19 02:01:23,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:23,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626747065] [2019-12-19 02:01:23,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:23,387 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-19 02:01:23,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626747065] [2019-12-19 02:01:23,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:23,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:01:23,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590395825] [2019-12-19 02:01:23,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:01:23,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:23,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:01:23,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:01:23,389 INFO L87 Difference]: Start difference. First operand 4983 states and 10993 transitions. Second operand 5 states. [2019-12-19 02:01:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:23,707 INFO L93 Difference]: Finished difference Result 5858 states and 12866 transitions. [2019-12-19 02:01:23,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:23,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:01:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:23,715 INFO L225 Difference]: With dead ends: 5858 [2019-12-19 02:01:23,715 INFO L226 Difference]: Without dead ends: 5858 [2019-12-19 02:01:23,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-12-19 02:01:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 5105. [2019-12-19 02:01:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2019-12-19 02:01:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 11259 transitions. [2019-12-19 02:01:23,767 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 11259 transitions. Word has length 98 [2019-12-19 02:01:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:23,767 INFO L462 AbstractCegarLoop]: Abstraction has 5105 states and 11259 transitions. [2019-12-19 02:01:23,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:01:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 11259 transitions. [2019-12-19 02:01:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:01:24,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:24,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:24,079 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1087998493, now seen corresponding path program 2 times [2019-12-19 02:01:24,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:24,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651144703] [2019-12-19 02:01:24,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:24,211 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-19 02:01:24,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651144703] [2019-12-19 02:01:24,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:24,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:24,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346685232] [2019-12-19 02:01:24,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:24,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:24,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:24,224 INFO L87 Difference]: Start difference. First operand 5105 states and 11259 transitions. Second operand 7 states. [2019-12-19 02:01:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:25,250 INFO L93 Difference]: Finished difference Result 9237 states and 19996 transitions. [2019-12-19 02:01:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-19 02:01:25,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-19 02:01:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:25,261 INFO L225 Difference]: With dead ends: 9237 [2019-12-19 02:01:25,261 INFO L226 Difference]: Without dead ends: 9183 [2019-12-19 02:01:25,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-19 02:01:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9183 states. [2019-12-19 02:01:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9183 to 7575. [2019-12-19 02:01:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7575 states. [2019-12-19 02:01:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7575 states to 7575 states and 16492 transitions. [2019-12-19 02:01:25,345 INFO L78 Accepts]: Start accepts. Automaton has 7575 states and 16492 transitions. Word has length 98 [2019-12-19 02:01:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:25,345 INFO L462 AbstractCegarLoop]: Abstraction has 7575 states and 16492 transitions. [2019-12-19 02:01:25,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 7575 states and 16492 transitions. [2019-12-19 02:01:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:01:25,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:25,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:25,354 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:25,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018300, now seen corresponding path program 1 times [2019-12-19 02:01:25,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:25,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101023033] [2019-12-19 02:01:25,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:25,444 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-19 02:01:25,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101023033] [2019-12-19 02:01:25,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:25,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:25,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198829459] [2019-12-19 02:01:25,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:25,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:25,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:25,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:25,446 INFO L87 Difference]: Start difference. First operand 7575 states and 16492 transitions. Second operand 7 states. [2019-12-19 02:01:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:26,364 INFO L93 Difference]: Finished difference Result 10520 states and 22647 transitions. [2019-12-19 02:01:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 02:01:26,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-19 02:01:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:26,376 INFO L225 Difference]: With dead ends: 10520 [2019-12-19 02:01:26,376 INFO L226 Difference]: Without dead ends: 10520 [2019-12-19 02:01:26,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-19 02:01:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10520 states. [2019-12-19 02:01:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10520 to 8308. [2019-12-19 02:01:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8308 states. [2019-12-19 02:01:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8308 states to 8308 states and 18105 transitions. [2019-12-19 02:01:26,472 INFO L78 Accepts]: Start accepts. Automaton has 8308 states and 18105 transitions. Word has length 98 [2019-12-19 02:01:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:26,472 INFO L462 AbstractCegarLoop]: Abstraction has 8308 states and 18105 transitions. [2019-12-19 02:01:26,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 8308 states and 18105 transitions. [2019-12-19 02:01:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:01:26,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:26,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:26,481 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash -919037989, now seen corresponding path program 1 times [2019-12-19 02:01:26,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:26,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107623252] [2019-12-19 02:01:26,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:26,547 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-19 02:01:26,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107623252] [2019-12-19 02:01:26,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:26,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:01:26,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328203446] [2019-12-19 02:01:26,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:01:26,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:26,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:01:26,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:01:26,549 INFO L87 Difference]: Start difference. First operand 8308 states and 18105 transitions. Second operand 4 states. [2019-12-19 02:01:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:26,669 INFO L93 Difference]: Finished difference Result 8762 states and 18993 transitions. [2019-12-19 02:01:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:01:26,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-19 02:01:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:26,678 INFO L225 Difference]: With dead ends: 8762 [2019-12-19 02:01:26,678 INFO L226 Difference]: Without dead ends: 8680 [2019-12-19 02:01:26,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:01:26,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2019-12-19 02:01:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 7394. [2019-12-19 02:01:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7394 states. [2019-12-19 02:01:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7394 states to 7394 states and 16140 transitions. [2019-12-19 02:01:26,755 INFO L78 Accepts]: Start accepts. Automaton has 7394 states and 16140 transitions. Word has length 98 [2019-12-19 02:01:26,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:26,756 INFO L462 AbstractCegarLoop]: Abstraction has 7394 states and 16140 transitions. [2019-12-19 02:01:26,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:01:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 7394 states and 16140 transitions. [2019-12-19 02:01:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:26,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:26,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:26,763 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:26,764 INFO L82 PathProgramCache]: Analyzing trace with hash 663708553, now seen corresponding path program 1 times [2019-12-19 02:01:26,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:26,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355486788] [2019-12-19 02:01:26,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:26,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-19 02:01:26,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355486788] [2019-12-19 02:01:26,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:26,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:01:26,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625275802] [2019-12-19 02:01:26,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:01:26,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:01:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:26,849 INFO L87 Difference]: Start difference. First operand 7394 states and 16140 transitions. Second operand 6 states. [2019-12-19 02:01:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:27,080 INFO L93 Difference]: Finished difference Result 8034 states and 17448 transitions. [2019-12-19 02:01:27,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:01:27,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-19 02:01:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:27,090 INFO L225 Difference]: With dead ends: 8034 [2019-12-19 02:01:27,090 INFO L226 Difference]: Without dead ends: 8034 [2019-12-19 02:01:27,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8034 states. [2019-12-19 02:01:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8034 to 7266. [2019-12-19 02:01:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7266 states. [2019-12-19 02:01:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 15909 transitions. [2019-12-19 02:01:27,167 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 15909 transitions. Word has length 100 [2019-12-19 02:01:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:27,167 INFO L462 AbstractCegarLoop]: Abstraction has 7266 states and 15909 transitions. [2019-12-19 02:01:27,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 15909 transitions. [2019-12-19 02:01:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:27,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:27,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:27,174 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:27,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:27,174 INFO L82 PathProgramCache]: Analyzing trace with hash -582643184, now seen corresponding path program 1 times [2019-12-19 02:01:27,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:27,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819916893] [2019-12-19 02:01:27,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:27,246 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-19 02:01:27,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819916893] [2019-12-19 02:01:27,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:27,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:01:27,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525822461] [2019-12-19 02:01:27,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:01:27,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:27,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:01:27,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:01:27,249 INFO L87 Difference]: Start difference. First operand 7266 states and 15909 transitions. Second operand 5 states. [2019-12-19 02:01:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:27,379 INFO L93 Difference]: Finished difference Result 7889 states and 17236 transitions. [2019-12-19 02:01:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:01:27,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-19 02:01:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:27,389 INFO L225 Difference]: With dead ends: 7889 [2019-12-19 02:01:27,389 INFO L226 Difference]: Without dead ends: 7889 [2019-12-19 02:01:27,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-19 02:01:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7889 states. [2019-12-19 02:01:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7889 to 6234. [2019-12-19 02:01:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2019-12-19 02:01:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 13642 transitions. [2019-12-19 02:01:27,456 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 13642 transitions. Word has length 100 [2019-12-19 02:01:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:27,457 INFO L462 AbstractCegarLoop]: Abstraction has 6234 states and 13642 transitions. [2019-12-19 02:01:27,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:01:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 13642 transitions. [2019-12-19 02:01:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:27,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:27,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:27,462 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:27,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash -231843247, now seen corresponding path program 1 times [2019-12-19 02:01:27,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:27,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512093820] [2019-12-19 02:01:27,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:27,521 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-19 02:01:27,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512093820] [2019-12-19 02:01:27,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:27,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:01:27,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356188502] [2019-12-19 02:01:27,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:01:27,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:01:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:01:27,523 INFO L87 Difference]: Start difference. First operand 6234 states and 13642 transitions. Second operand 4 states. [2019-12-19 02:01:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:27,843 INFO L93 Difference]: Finished difference Result 7306 states and 15945 transitions. [2019-12-19 02:01:27,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:01:27,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-19 02:01:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:27,854 INFO L225 Difference]: With dead ends: 7306 [2019-12-19 02:01:27,855 INFO L226 Difference]: Without dead ends: 7268 [2019-12-19 02:01:27,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 02:01:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2019-12-19 02:01:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 6191. [2019-12-19 02:01:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6191 states. [2019-12-19 02:01:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 13665 transitions. [2019-12-19 02:01:27,977 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 13665 transitions. Word has length 100 [2019-12-19 02:01:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:27,978 INFO L462 AbstractCegarLoop]: Abstraction has 6191 states and 13665 transitions. [2019-12-19 02:01:27,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:01:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 13665 transitions. [2019-12-19 02:01:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:27,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:27,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:27,988 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:27,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:27,988 INFO L82 PathProgramCache]: Analyzing trace with hash -200823440, now seen corresponding path program 1 times [2019-12-19 02:01:27,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:27,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797264912] [2019-12-19 02:01:27,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:28,178 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-19 02:01:28,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797264912] [2019-12-19 02:01:28,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:28,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:01:28,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926320640] [2019-12-19 02:01:28,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:01:28,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:01:28,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:01:28,181 INFO L87 Difference]: Start difference. First operand 6191 states and 13665 transitions. Second operand 9 states. [2019-12-19 02:01:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:29,256 INFO L93 Difference]: Finished difference Result 7744 states and 16952 transitions. [2019-12-19 02:01:29,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:01:29,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-12-19 02:01:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:29,266 INFO L225 Difference]: With dead ends: 7744 [2019-12-19 02:01:29,266 INFO L226 Difference]: Without dead ends: 7744 [2019-12-19 02:01:29,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-19 02:01:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7744 states. [2019-12-19 02:01:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7744 to 6525. [2019-12-19 02:01:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6525 states. [2019-12-19 02:01:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6525 states to 6525 states and 14346 transitions. [2019-12-19 02:01:29,334 INFO L78 Accepts]: Start accepts. Automaton has 6525 states and 14346 transitions. Word has length 100 [2019-12-19 02:01:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:29,334 INFO L462 AbstractCegarLoop]: Abstraction has 6525 states and 14346 transitions. [2019-12-19 02:01:29,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:01:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6525 states and 14346 transitions. [2019-12-19 02:01:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:29,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:29,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:29,340 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2056087567, now seen corresponding path program 1 times [2019-12-19 02:01:29,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:29,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964042060] [2019-12-19 02:01:29,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:29,498 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-19 02:01:29,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964042060] [2019-12-19 02:01:29,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:29,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:01:29,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436803145] [2019-12-19 02:01:29,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:01:29,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:29,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:01:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:29,500 INFO L87 Difference]: Start difference. First operand 6525 states and 14346 transitions. Second operand 8 states. [2019-12-19 02:01:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:29,606 INFO L93 Difference]: Finished difference Result 10669 states and 23574 transitions. [2019-12-19 02:01:29,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:29,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-12-19 02:01:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:29,612 INFO L225 Difference]: With dead ends: 10669 [2019-12-19 02:01:29,612 INFO L226 Difference]: Without dead ends: 4367 [2019-12-19 02:01:29,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:01:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4367 states. [2019-12-19 02:01:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4367 to 4367. [2019-12-19 02:01:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4367 states. [2019-12-19 02:01:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4367 states to 4367 states and 9647 transitions. [2019-12-19 02:01:29,651 INFO L78 Accepts]: Start accepts. Automaton has 4367 states and 9647 transitions. Word has length 100 [2019-12-19 02:01:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:29,651 INFO L462 AbstractCegarLoop]: Abstraction has 4367 states and 9647 transitions. [2019-12-19 02:01:29,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:01:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 4367 states and 9647 transitions. [2019-12-19 02:01:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:29,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:29,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:29,656 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:29,656 INFO L82 PathProgramCache]: Analyzing trace with hash -752397989, now seen corresponding path program 2 times [2019-12-19 02:01:29,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:29,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65837895] [2019-12-19 02:01:29,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:29,814 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-19 02:01:29,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65837895] [2019-12-19 02:01:29,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:29,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:01:29,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121679614] [2019-12-19 02:01:29,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:01:29,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:29,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:01:29,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:01:29,816 INFO L87 Difference]: Start difference. First operand 4367 states and 9647 transitions. Second operand 10 states. [2019-12-19 02:01:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:30,426 INFO L93 Difference]: Finished difference Result 9693 states and 21618 transitions. [2019-12-19 02:01:30,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:01:30,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-12-19 02:01:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:30,437 INFO L225 Difference]: With dead ends: 9693 [2019-12-19 02:01:30,437 INFO L226 Difference]: Without dead ends: 6197 [2019-12-19 02:01:30,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-19 02:01:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-12-19 02:01:30,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 4392. [2019-12-19 02:01:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4392 states. [2019-12-19 02:01:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 9653 transitions. [2019-12-19 02:01:30,541 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 9653 transitions. Word has length 100 [2019-12-19 02:01:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:30,541 INFO L462 AbstractCegarLoop]: Abstraction has 4392 states and 9653 transitions. [2019-12-19 02:01:30,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:01:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 9653 transitions. [2019-12-19 02:01:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:30,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:30,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:30,550 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:30,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:30,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1039722168, now seen corresponding path program 1 times [2019-12-19 02:01:30,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:30,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649391691] [2019-12-19 02:01:30,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:30,718 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-19 02:01:30,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649391691] [2019-12-19 02:01:30,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:30,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:01:30,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154022903] [2019-12-19 02:01:30,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:01:30,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:30,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:01:30,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:30,721 INFO L87 Difference]: Start difference. First operand 4392 states and 9653 transitions. Second operand 6 states. [2019-12-19 02:01:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:30,929 INFO L93 Difference]: Finished difference Result 4884 states and 10655 transitions. [2019-12-19 02:01:30,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:01:30,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-19 02:01:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:30,937 INFO L225 Difference]: With dead ends: 4884 [2019-12-19 02:01:30,937 INFO L226 Difference]: Without dead ends: 4856 [2019-12-19 02:01:30,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4856 states. [2019-12-19 02:01:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4856 to 4344. [2019-12-19 02:01:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4344 states. [2019-12-19 02:01:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 9486 transitions. [2019-12-19 02:01:31,002 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 9486 transitions. Word has length 100 [2019-12-19 02:01:31,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:31,003 INFO L462 AbstractCegarLoop]: Abstraction has 4344 states and 9486 transitions. [2019-12-19 02:01:31,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 9486 transitions. [2019-12-19 02:01:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:31,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:31,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:31,009 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1783729907, now seen corresponding path program 1 times [2019-12-19 02:01:31,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:31,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520381751] [2019-12-19 02:01:31,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:31,068 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-19 02:01:31,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520381751] [2019-12-19 02:01:31,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:31,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:01:31,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878825945] [2019-12-19 02:01:31,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:01:31,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:31,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:01:31,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:01:31,070 INFO L87 Difference]: Start difference. First operand 4344 states and 9486 transitions. Second operand 5 states. [2019-12-19 02:01:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:31,310 INFO L93 Difference]: Finished difference Result 5226 states and 11294 transitions. [2019-12-19 02:01:31,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:31,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-19 02:01:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:31,317 INFO L225 Difference]: With dead ends: 5226 [2019-12-19 02:01:31,317 INFO L226 Difference]: Without dead ends: 5156 [2019-12-19 02:01:31,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5156 states. [2019-12-19 02:01:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5156 to 4383. [2019-12-19 02:01:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-12-19 02:01:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 9583 transitions. [2019-12-19 02:01:31,363 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 9583 transitions. Word has length 100 [2019-12-19 02:01:31,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:31,363 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 9583 transitions. [2019-12-19 02:01:31,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:01:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 9583 transitions. [2019-12-19 02:01:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:31,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:31,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:31,368 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:31,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:31,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2013230097, now seen corresponding path program 2 times [2019-12-19 02:01:31,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:31,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003021950] [2019-12-19 02:01:31,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:31,536 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-19 02:01:31,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003021950] [2019-12-19 02:01:31,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:31,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:01:31,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598525038] [2019-12-19 02:01:31,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:01:31,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:31,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:01:31,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:01:31,538 INFO L87 Difference]: Start difference. First operand 4383 states and 9583 transitions. Second operand 9 states. [2019-12-19 02:01:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:32,139 INFO L93 Difference]: Finished difference Result 4803 states and 10458 transitions. [2019-12-19 02:01:32,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:01:32,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-12-19 02:01:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:32,146 INFO L225 Difference]: With dead ends: 4803 [2019-12-19 02:01:32,146 INFO L226 Difference]: Without dead ends: 4797 [2019-12-19 02:01:32,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-19 02:01:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2019-12-19 02:01:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4434. [2019-12-19 02:01:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4434 states. [2019-12-19 02:01:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 9706 transitions. [2019-12-19 02:01:32,190 INFO L78 Accepts]: Start accepts. Automaton has 4434 states and 9706 transitions. Word has length 100 [2019-12-19 02:01:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:32,190 INFO L462 AbstractCegarLoop]: Abstraction has 4434 states and 9706 transitions. [2019-12-19 02:01:32,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:01:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4434 states and 9706 transitions. [2019-12-19 02:01:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:32,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:32,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:32,194 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 243680910, now seen corresponding path program 1 times [2019-12-19 02:01:32,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:32,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646111817] [2019-12-19 02:01:32,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:32,278 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-19 02:01:32,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646111817] [2019-12-19 02:01:32,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:32,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:01:32,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281067276] [2019-12-19 02:01:32,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:01:32,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:32,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:01:32,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:01:32,280 INFO L87 Difference]: Start difference. First operand 4434 states and 9706 transitions. Second operand 6 states. [2019-12-19 02:01:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:32,470 INFO L93 Difference]: Finished difference Result 4560 states and 9936 transitions. [2019-12-19 02:01:32,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:32,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-19 02:01:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:32,475 INFO L225 Difference]: With dead ends: 4560 [2019-12-19 02:01:32,475 INFO L226 Difference]: Without dead ends: 4560 [2019-12-19 02:01:32,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4560 states. [2019-12-19 02:01:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4560 to 4308. [2019-12-19 02:01:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4308 states. [2019-12-19 02:01:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4308 states to 4308 states and 9416 transitions. [2019-12-19 02:01:32,519 INFO L78 Accepts]: Start accepts. Automaton has 4308 states and 9416 transitions. Word has length 100 [2019-12-19 02:01:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:32,519 INFO L462 AbstractCegarLoop]: Abstraction has 4308 states and 9416 transitions. [2019-12-19 02:01:32,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:01:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4308 states and 9416 transitions. [2019-12-19 02:01:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:32,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:32,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:32,523 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:32,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:32,523 INFO L82 PathProgramCache]: Analyzing trace with hash 117038585, now seen corresponding path program 1 times [2019-12-19 02:01:32,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:32,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248922254] [2019-12-19 02:01:32,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:32,662 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-19 02:01:32,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248922254] [2019-12-19 02:01:32,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:32,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:32,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505203805] [2019-12-19 02:01:32,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:32,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:32,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:32,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:32,663 INFO L87 Difference]: Start difference. First operand 4308 states and 9416 transitions. Second operand 7 states. [2019-12-19 02:01:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:33,197 INFO L93 Difference]: Finished difference Result 4941 states and 10678 transitions. [2019-12-19 02:01:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:01:33,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-19 02:01:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:33,204 INFO L225 Difference]: With dead ends: 4941 [2019-12-19 02:01:33,204 INFO L226 Difference]: Without dead ends: 4941 [2019-12-19 02:01:33,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2019-12-19 02:01:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 4330. [2019-12-19 02:01:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4330 states. [2019-12-19 02:01:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 9464 transitions. [2019-12-19 02:01:33,272 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 9464 transitions. Word has length 100 [2019-12-19 02:01:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:33,272 INFO L462 AbstractCegarLoop]: Abstraction has 4330 states and 9464 transitions. [2019-12-19 02:01:33,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 9464 transitions. [2019-12-19 02:01:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:33,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:33,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:33,278 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1921017704, now seen corresponding path program 1 times [2019-12-19 02:01:33,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:33,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112099371] [2019-12-19 02:01:33,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:33,423 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-19 02:01:33,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112099371] [2019-12-19 02:01:33,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:33,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:33,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970421369] [2019-12-19 02:01:33,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:33,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:33,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:33,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:33,425 INFO L87 Difference]: Start difference. First operand 4330 states and 9464 transitions. Second operand 7 states. [2019-12-19 02:01:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:33,763 INFO L93 Difference]: Finished difference Result 4603 states and 10020 transitions. [2019-12-19 02:01:33,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:01:33,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-19 02:01:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:33,768 INFO L225 Difference]: With dead ends: 4603 [2019-12-19 02:01:33,768 INFO L226 Difference]: Without dead ends: 4603 [2019-12-19 02:01:33,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:01:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4603 states. [2019-12-19 02:01:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4603 to 4338. [2019-12-19 02:01:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4338 states. [2019-12-19 02:01:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 9466 transitions. [2019-12-19 02:01:34,109 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 9466 transitions. Word has length 100 [2019-12-19 02:01:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:34,109 INFO L462 AbstractCegarLoop]: Abstraction has 4338 states and 9466 transitions. [2019-12-19 02:01:34,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 9466 transitions. [2019-12-19 02:01:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:34,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:34,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:34,113 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash -805563302, now seen corresponding path program 2 times [2019-12-19 02:01:34,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:34,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127531664] [2019-12-19 02:01:34,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:34,271 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-19 02:01:34,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127531664] [2019-12-19 02:01:34,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:34,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:01:34,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313989063] [2019-12-19 02:01:34,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:01:34,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:01:34,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:34,273 INFO L87 Difference]: Start difference. First operand 4338 states and 9466 transitions. Second operand 8 states. [2019-12-19 02:01:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:34,747 INFO L93 Difference]: Finished difference Result 4928 states and 10633 transitions. [2019-12-19 02:01:34,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:01:34,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-12-19 02:01:34,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:34,752 INFO L225 Difference]: With dead ends: 4928 [2019-12-19 02:01:34,752 INFO L226 Difference]: Without dead ends: 4928 [2019-12-19 02:01:34,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-19 02:01:34,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2019-12-19 02:01:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4349. [2019-12-19 02:01:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4349 states. [2019-12-19 02:01:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4349 states to 4349 states and 9498 transitions. [2019-12-19 02:01:34,795 INFO L78 Accepts]: Start accepts. Automaton has 4349 states and 9498 transitions. Word has length 100 [2019-12-19 02:01:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:34,796 INFO L462 AbstractCegarLoop]: Abstraction has 4349 states and 9498 transitions. [2019-12-19 02:01:34,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:01:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4349 states and 9498 transitions. [2019-12-19 02:01:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:34,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:34,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:01:34,802 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1451347705, now seen corresponding path program 3 times [2019-12-19 02:01:34,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:34,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624793617] [2019-12-19 02:01:34,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:01:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:01:34,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:01:34,890 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:01:35,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:01:35 BasicIcfg [2019-12-19 02:01:35,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:01:35,098 INFO L168 Benchmark]: Toolchain (without parser) took 58812.54 ms. Allocated memory was 145.2 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 100.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 801.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:35,098 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 02:01:35,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.99 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 99.6 MB in the beginning and 156.9 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:35,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.85 ms. Allocated memory is still 203.9 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:35,099 INFO L168 Benchmark]: Boogie Preprocessor took 44.14 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:35,100 INFO L168 Benchmark]: RCFGBuilder took 832.00 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 107.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:35,100 INFO L168 Benchmark]: TraceAbstraction took 57089.34 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 106.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 748.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:35,103 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.45 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.99 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 99.6 MB in the beginning and 156.9 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.85 ms. Allocated memory is still 203.9 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.14 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.00 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 107.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57089.34 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 106.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 748.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L705] 0 _Bool a$flush_delayed; 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] [L706] 0 int a$mem_tmp; 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] [L707] 0 _Bool a$r_buff0_thd0; 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] [L708] 0 _Bool a$r_buff0_thd1; 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] [L709] 0 _Bool a$r_buff0_thd2; 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] [L710] 0 _Bool a$r_buff1_thd0; 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] [L711] 0 _Bool a$r_buff1_thd1; 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] [L712] 0 _Bool a$r_buff1_thd2; 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] [L713] 0 _Bool a$read_delayed; 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] [L714] 0 int *a$read_delayed_var; 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}] [L715] 0 int a$w_buff0; 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] [L716] 0 _Bool a$w_buff0_used; 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] [L717] 0 int a$w_buff1; 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] [L718] 0 _Bool a$w_buff1_used; 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] [L719] 0 _Bool main$tmp_guard0; 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] [L720] 0 _Bool main$tmp_guard1; 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] [L722] 0 int x = 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, x=0] [L724] 0 int y = 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, x=0, y=0] [L726] 0 int z = 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, x=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; 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, x=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; 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] [L813] 0 pthread_t t845; 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] [L814] FCALL, FORK 0 pthread_create(&t845, ((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] [L815] 0 pthread_t t846; 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] [L732] 1 a$w_buff1 = a$w_buff0 [L733] 1 a$w_buff0 = 1 [L734] 1 a$w_buff1_used = a$w_buff0_used [L735] 1 a$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) 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, 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(&t846, ((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] EXPR 2 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)) 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_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))=0, x=1, y=1, z=1] [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)) [L784] EXPR 2 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) 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_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L784] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [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] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_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=1, 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] [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=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] [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 [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=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] [L787] EXPR 2 a$flush_delayed ? 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=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=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] [L787] 2 a = a$flush_delayed ? a$mem_tmp : a [L788] 2 a$flush_delayed = (_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=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] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=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] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=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] EXPR 2 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=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_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : 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] [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L755] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_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=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_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_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] [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 [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 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=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] [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 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=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_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=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] [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 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=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_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=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] [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 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] [L756] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__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=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__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] [L822] EXPR 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 [__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] [L822] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__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] [L822] EXPR 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 [__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] [L822] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L823] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__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] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__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] [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] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__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] [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L826] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__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] [L826] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__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] [L4] COND TRUE 0 !expression VAL [__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] [L4] 0 __VERIFIER_error() VAL [__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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 56.6s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10319 SDtfs, 11548 SDslu, 23865 SDs, 0 SdLazy, 9546 SolverSat, 540 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 107 SyntacticMatches, 32 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71016occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 87405 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3109 NumberOfCodeBlocks, 3109 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2971 ConstructedInterpolants, 0 QuantifiedInterpolants, 704093 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...