/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/mix000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:54:36,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:54:36,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:54:37,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:54:37,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:54:37,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:54:37,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:54:37,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:54:37,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:54:37,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:54:37,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:54:37,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:54:37,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:54:37,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:54:37,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:54:37,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:54:37,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:54:37,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:54:37,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:54:37,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:54:37,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:54:37,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:54:37,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:54:37,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:54:37,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:54:37,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:54:37,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:54:37,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:54:37,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:54:37,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:54:37,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:54:37,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:54:37,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:54:37,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:54:37,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:54:37,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:54:37,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:54:37,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:54:37,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:54:37,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:54:37,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:54:37,043 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-18 23:54:37,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:54:37,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:54:37,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:54:37,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:54:37,059 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:54:37,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:54:37,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:54:37,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:54:37,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:54:37,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:54:37,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:54:37,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:54:37,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:54:37,061 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:54:37,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:54:37,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:54:37,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:54:37,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:54:37,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:54:37,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:54:37,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:54:37,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:54:37,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:54:37,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:54:37,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:54:37,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:54:37,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:54:37,064 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-18 23:54:37,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:54:37,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:54:37,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:54:37,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:54:37,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:54:37,343 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:54:37,343 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:54:37,344 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-18 23:54:37,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/027df7fb4/226f704aa046446189248fabc4198f42/FLAGd0b01fe8f [2019-12-18 23:54:37,986 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:54:37,987 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-18 23:54:38,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/027df7fb4/226f704aa046446189248fabc4198f42/FLAGd0b01fe8f [2019-12-18 23:54:38,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/027df7fb4/226f704aa046446189248fabc4198f42 [2019-12-18 23:54:38,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:54:38,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:54:38,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:54:38,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:54:38,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:54:38,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:54:38" (1/1) ... [2019-12-18 23:54:38,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317ba546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:38, skipping insertion in model container [2019-12-18 23:54:38,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:54:38" (1/1) ... [2019-12-18 23:54:38,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:54:38,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:54:38,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:54:38,898 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:54:38,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:54:39,040 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:54:39,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39 WrapperNode [2019-12-18 23:54:39,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:54:39,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:54:39,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:54:39,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:54:39,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... [2019-12-18 23:54:39,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... [2019-12-18 23:54:39,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:54:39,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:54:39,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:54:39,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:54:39,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... [2019-12-18 23:54:39,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... [2019-12-18 23:54:39,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... [2019-12-18 23:54:39,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... [2019-12-18 23:54:39,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... [2019-12-18 23:54:39,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... [2019-12-18 23:54:39,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... [2019-12-18 23:54:39,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:54:39,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:54:39,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:54:39,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:54:39,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:54:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:54:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:54:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:54:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:54:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:54:39,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:54:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:54:39,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:54:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:54:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:54:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:54:39,278 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:54:40,149 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:54:40,149 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:54:40,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:54:40 BoogieIcfgContainer [2019-12-18 23:54:40,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:54:40,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:54:40,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:54:40,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:54:40,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:54:38" (1/3) ... [2019-12-18 23:54:40,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8e96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:54:40, skipping insertion in model container [2019-12-18 23:54:40,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:54:39" (2/3) ... [2019-12-18 23:54:40,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf8e96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:54:40, skipping insertion in model container [2019-12-18 23:54:40,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:54:40" (3/3) ... [2019-12-18 23:54:40,165 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_rmo.oepc.i [2019-12-18 23:54:40,176 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:54:40,177 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:54:40,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:54:40,191 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:54:40,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,349 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:54:40,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:54:40,393 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:54:40,393 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:54:40,393 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:54:40,394 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:54:40,394 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:54:40,394 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:54:40,394 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:54:40,394 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:54:40,409 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 191 places, 246 transitions [2019-12-18 23:54:52,851 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100969 states. [2019-12-18 23:54:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 100969 states. [2019-12-18 23:54:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 23:54:52,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:54:52,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:54:52,862 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:54:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:54:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1867003899, now seen corresponding path program 1 times [2019-12-18 23:54:52,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:54:52,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652894703] [2019-12-18 23:54:52,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:54:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:54:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:54:53,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652894703] [2019-12-18 23:54:53,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:54:53,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:54:53,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984432753] [2019-12-18 23:54:53,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:54:53,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:54:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:54:53,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:54:53,263 INFO L87 Difference]: Start difference. First operand 100969 states. Second operand 4 states. [2019-12-18 23:54:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:54:56,768 INFO L93 Difference]: Finished difference Result 101969 states and 411474 transitions. [2019-12-18 23:54:56,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:54:56,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-18 23:54:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:54:57,333 INFO L225 Difference]: With dead ends: 101969 [2019-12-18 23:54:57,334 INFO L226 Difference]: Without dead ends: 74593 [2019-12-18 23:54:57,336 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-18 23:54:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74593 states. [2019-12-18 23:55:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74593 to 74593. [2019-12-18 23:55:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74593 states. [2019-12-18 23:55:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74593 states to 74593 states and 304546 transitions. [2019-12-18 23:55:01,392 INFO L78 Accepts]: Start accepts. Automaton has 74593 states and 304546 transitions. Word has length 36 [2019-12-18 23:55:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:01,392 INFO L462 AbstractCegarLoop]: Abstraction has 74593 states and 304546 transitions. [2019-12-18 23:55:01,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:55:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 74593 states and 304546 transitions. [2019-12-18 23:55:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 23:55:01,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:01,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:55:01,403 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:01,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1051219315, now seen corresponding path program 1 times [2019-12-18 23:55:01,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:01,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268213296] [2019-12-18 23:55:01,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:55:01,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268213296] [2019-12-18 23:55:01,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:01,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:55:01,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407770827] [2019-12-18 23:55:01,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:55:01,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:55:01,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:55:01,524 INFO L87 Difference]: Start difference. First operand 74593 states and 304546 transitions. Second operand 5 states. [2019-12-18 23:55:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:06,171 INFO L93 Difference]: Finished difference Result 121639 states and 464551 transitions. [2019-12-18 23:55:06,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:55:06,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-18 23:55:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:06,659 INFO L225 Difference]: With dead ends: 121639 [2019-12-18 23:55:06,659 INFO L226 Difference]: Without dead ends: 121103 [2019-12-18 23:55:06,660 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-18 23:55:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121103 states. [2019-12-18 23:55:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121103 to 119213. [2019-12-18 23:55:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119213 states. [2019-12-18 23:55:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119213 states to 119213 states and 456891 transitions. [2019-12-18 23:55:15,715 INFO L78 Accepts]: Start accepts. Automaton has 119213 states and 456891 transitions. Word has length 48 [2019-12-18 23:55:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:15,717 INFO L462 AbstractCegarLoop]: Abstraction has 119213 states and 456891 transitions. [2019-12-18 23:55:15,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:55:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 119213 states and 456891 transitions. [2019-12-18 23:55:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-18 23:55:15,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:15,723 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] [2019-12-18 23:55:15,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1611122121, now seen corresponding path program 1 times [2019-12-18 23:55:15,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:15,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748629215] [2019-12-18 23:55:15,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:55:15,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748629215] [2019-12-18 23:55:15,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:15,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:55:15,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502255491] [2019-12-18 23:55:15,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:55:15,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:15,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:55:15,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:55:15,857 INFO L87 Difference]: Start difference. First operand 119213 states and 456891 transitions. Second operand 5 states. [2019-12-18 23:55:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:16,990 INFO L93 Difference]: Finished difference Result 149065 states and 560747 transitions. [2019-12-18 23:55:16,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:55:16,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-18 23:55:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:17,346 INFO L225 Difference]: With dead ends: 149065 [2019-12-18 23:55:17,347 INFO L226 Difference]: Without dead ends: 148561 [2019-12-18 23:55:17,347 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-18 23:55:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148561 states. [2019-12-18 23:55:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148561 to 131878. [2019-12-18 23:55:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131878 states. [2019-12-18 23:55:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131878 states to 131878 states and 501408 transitions. [2019-12-18 23:55:27,348 INFO L78 Accepts]: Start accepts. Automaton has 131878 states and 501408 transitions. Word has length 49 [2019-12-18 23:55:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:27,351 INFO L462 AbstractCegarLoop]: Abstraction has 131878 states and 501408 transitions. [2019-12-18 23:55:27,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:55:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 131878 states and 501408 transitions. [2019-12-18 23:55:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 23:55:27,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:27,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:55:27,366 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1163539633, now seen corresponding path program 1 times [2019-12-18 23:55:27,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:27,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800440320] [2019-12-18 23:55:27,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:55:27,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800440320] [2019-12-18 23:55:27,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:27,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:55:27,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028252006] [2019-12-18 23:55:27,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:55:27,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:55:27,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:55:27,453 INFO L87 Difference]: Start difference. First operand 131878 states and 501408 transitions. Second operand 3 states. [2019-12-18 23:55:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:28,539 INFO L93 Difference]: Finished difference Result 226103 states and 838073 transitions. [2019-12-18 23:55:28,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:55:28,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 23:55:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:35,053 INFO L225 Difference]: With dead ends: 226103 [2019-12-18 23:55:35,054 INFO L226 Difference]: Without dead ends: 226103 [2019-12-18 23:55:35,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:55:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226103 states. [2019-12-18 23:55:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226103 to 201720. [2019-12-18 23:55:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201720 states. [2019-12-18 23:55:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201720 states to 201720 states and 750697 transitions. [2019-12-18 23:55:40,984 INFO L78 Accepts]: Start accepts. Automaton has 201720 states and 750697 transitions. Word has length 51 [2019-12-18 23:55:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:40,985 INFO L462 AbstractCegarLoop]: Abstraction has 201720 states and 750697 transitions. [2019-12-18 23:55:40,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:55:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 201720 states and 750697 transitions. [2019-12-18 23:55:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:55:41,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:41,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:55:41,011 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1032930122, now seen corresponding path program 1 times [2019-12-18 23:55:41,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:41,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865078793] [2019-12-18 23:55:41,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:55:42,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865078793] [2019-12-18 23:55:42,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:42,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:55:42,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690192776] [2019-12-18 23:55:42,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:55:42,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:55:42,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:55:42,451 INFO L87 Difference]: Start difference. First operand 201720 states and 750697 transitions. Second operand 6 states. [2019-12-18 23:55:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:44,528 INFO L93 Difference]: Finished difference Result 257719 states and 956292 transitions. [2019-12-18 23:55:44,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:55:44,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 23:55:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:52,596 INFO L225 Difference]: With dead ends: 257719 [2019-12-18 23:55:52,597 INFO L226 Difference]: Without dead ends: 257719 [2019-12-18 23:55:52,597 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-18 23:55:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257719 states. [2019-12-18 23:55:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257719 to 241036. [2019-12-18 23:55:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241036 states. [2019-12-18 23:56:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241036 states to 241036 states and 894179 transitions. [2019-12-18 23:56:01,115 INFO L78 Accepts]: Start accepts. Automaton has 241036 states and 894179 transitions. Word has length 55 [2019-12-18 23:56:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:01,115 INFO L462 AbstractCegarLoop]: Abstraction has 241036 states and 894179 transitions. [2019-12-18 23:56:01,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:56:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 241036 states and 894179 transitions. [2019-12-18 23:56:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:56:01,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:01,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:56:01,147 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:01,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:01,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1465085815, now seen corresponding path program 1 times [2019-12-18 23:56:01,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:01,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311601499] [2019-12-18 23:56:01,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:01,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311601499] [2019-12-18 23:56:01,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:01,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:56:01,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557639767] [2019-12-18 23:56:01,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:56:01,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:01,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:56:01,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:56:01,262 INFO L87 Difference]: Start difference. First operand 241036 states and 894179 transitions. Second operand 7 states. [2019-12-18 23:56:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:10,472 INFO L93 Difference]: Finished difference Result 334522 states and 1202846 transitions. [2019-12-18 23:56:10,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 23:56:10,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 23:56:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:11,368 INFO L225 Difference]: With dead ends: 334522 [2019-12-18 23:56:11,368 INFO L226 Difference]: Without dead ends: 334522 [2019-12-18 23:56:11,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 23:56:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334522 states. [2019-12-18 23:56:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334522 to 278543. [2019-12-18 23:56:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278543 states. [2019-12-18 23:56:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278543 states to 278543 states and 1017057 transitions. [2019-12-18 23:56:26,047 INFO L78 Accepts]: Start accepts. Automaton has 278543 states and 1017057 transitions. Word has length 55 [2019-12-18 23:56:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:26,047 INFO L462 AbstractCegarLoop]: Abstraction has 278543 states and 1017057 transitions. [2019-12-18 23:56:26,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:56:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 278543 states and 1017057 transitions. [2019-12-18 23:56:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:56:26,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:26,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:56:26,071 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:26,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1942377800, now seen corresponding path program 1 times [2019-12-18 23:56:26,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:26,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494174346] [2019-12-18 23:56:26,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:26,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494174346] [2019-12-18 23:56:26,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:26,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:56:26,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981886596] [2019-12-18 23:56:26,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:56:26,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:26,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:56:26,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:56:26,146 INFO L87 Difference]: Start difference. First operand 278543 states and 1017057 transitions. Second operand 4 states. [2019-12-18 23:56:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:32,251 INFO L93 Difference]: Finished difference Result 34538 states and 108800 transitions. [2019-12-18 23:56:32,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:56:32,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-18 23:56:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:32,296 INFO L225 Difference]: With dead ends: 34538 [2019-12-18 23:56:32,296 INFO L226 Difference]: Without dead ends: 26989 [2019-12-18 23:56:32,297 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-18 23:56:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26989 states. [2019-12-18 23:56:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26989 to 26730. [2019-12-18 23:56:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26730 states. [2019-12-18 23:56:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26730 states to 26730 states and 81037 transitions. [2019-12-18 23:56:32,639 INFO L78 Accepts]: Start accepts. Automaton has 26730 states and 81037 transitions. Word has length 55 [2019-12-18 23:56:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:32,639 INFO L462 AbstractCegarLoop]: Abstraction has 26730 states and 81037 transitions. [2019-12-18 23:56:32,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:56:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 26730 states and 81037 transitions. [2019-12-18 23:56:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:56:32,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:32,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:56:32,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:32,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash -125662630, now seen corresponding path program 1 times [2019-12-18 23:56:32,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:32,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182238073] [2019-12-18 23:56:32,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:32,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182238073] [2019-12-18 23:56:32,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:32,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:56:32,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677606983] [2019-12-18 23:56:32,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:56:32,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:32,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:56:32,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:56:32,713 INFO L87 Difference]: Start difference. First operand 26730 states and 81037 transitions. Second operand 6 states. [2019-12-18 23:56:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:33,520 INFO L93 Difference]: Finished difference Result 31474 states and 93784 transitions. [2019-12-18 23:56:33,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:56:33,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 23:56:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:33,590 INFO L225 Difference]: With dead ends: 31474 [2019-12-18 23:56:33,590 INFO L226 Difference]: Without dead ends: 31411 [2019-12-18 23:56:33,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:56:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31411 states. [2019-12-18 23:56:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31411 to 26773. [2019-12-18 23:56:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26773 states. [2019-12-18 23:56:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26773 states to 26773 states and 81115 transitions. [2019-12-18 23:56:34,230 INFO L78 Accepts]: Start accepts. Automaton has 26773 states and 81115 transitions. Word has length 55 [2019-12-18 23:56:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:34,230 INFO L462 AbstractCegarLoop]: Abstraction has 26773 states and 81115 transitions. [2019-12-18 23:56:34,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:56:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 26773 states and 81115 transitions. [2019-12-18 23:56:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 23:56:34,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:34,238 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] [2019-12-18 23:56:34,238 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1986032310, now seen corresponding path program 1 times [2019-12-18 23:56:34,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:34,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758889041] [2019-12-18 23:56:34,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:34,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758889041] [2019-12-18 23:56:34,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:34,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:56:34,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926734005] [2019-12-18 23:56:34,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:56:34,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:34,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:56:34,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:56:34,299 INFO L87 Difference]: Start difference. First operand 26773 states and 81115 transitions. Second operand 4 states. [2019-12-18 23:56:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:34,899 INFO L93 Difference]: Finished difference Result 31358 states and 94804 transitions. [2019-12-18 23:56:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:56:34,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-18 23:56:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:34,962 INFO L225 Difference]: With dead ends: 31358 [2019-12-18 23:56:34,962 INFO L226 Difference]: Without dead ends: 31358 [2019-12-18 23:56:34,963 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-18 23:56:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31358 states. [2019-12-18 23:56:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31358 to 30491. [2019-12-18 23:56:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30491 states. [2019-12-18 23:56:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30491 states to 30491 states and 92276 transitions. [2019-12-18 23:56:35,433 INFO L78 Accepts]: Start accepts. Automaton has 30491 states and 92276 transitions. Word has length 63 [2019-12-18 23:56:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:35,434 INFO L462 AbstractCegarLoop]: Abstraction has 30491 states and 92276 transitions. [2019-12-18 23:56:35,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:56:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30491 states and 92276 transitions. [2019-12-18 23:56:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 23:56:35,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:35,440 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] [2019-12-18 23:56:35,440 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash -566124651, now seen corresponding path program 1 times [2019-12-18 23:56:35,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:35,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127143864] [2019-12-18 23:56:35,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:35,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127143864] [2019-12-18 23:56:35,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:35,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:56:35,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719087864] [2019-12-18 23:56:35,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:56:35,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:35,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:56:35,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:56:35,527 INFO L87 Difference]: Start difference. First operand 30491 states and 92276 transitions. Second operand 6 states. [2019-12-18 23:56:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:36,297 INFO L93 Difference]: Finished difference Result 38026 states and 112750 transitions. [2019-12-18 23:56:36,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:56:36,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-18 23:56:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:36,352 INFO L225 Difference]: With dead ends: 38026 [2019-12-18 23:56:36,353 INFO L226 Difference]: Without dead ends: 37965 [2019-12-18 23:56:36,353 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-18 23:56:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37965 states. [2019-12-18 23:56:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37965 to 37190. [2019-12-18 23:56:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37190 states. [2019-12-18 23:56:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37190 states to 37190 states and 110476 transitions. [2019-12-18 23:56:37,150 INFO L78 Accepts]: Start accepts. Automaton has 37190 states and 110476 transitions. Word has length 63 [2019-12-18 23:56:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:37,151 INFO L462 AbstractCegarLoop]: Abstraction has 37190 states and 110476 transitions. [2019-12-18 23:56:37,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:56:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 37190 states and 110476 transitions. [2019-12-18 23:56:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 23:56:37,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:37,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:56:37,161 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:37,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:37,161 INFO L82 PathProgramCache]: Analyzing trace with hash -69430682, now seen corresponding path program 1 times [2019-12-18 23:56:37,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:37,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134231596] [2019-12-18 23:56:37,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:37,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134231596] [2019-12-18 23:56:37,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:37,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:56:37,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291237440] [2019-12-18 23:56:37,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:56:37,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:56:37,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:56:37,226 INFO L87 Difference]: Start difference. First operand 37190 states and 110476 transitions. Second operand 3 states. [2019-12-18 23:56:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:37,518 INFO L93 Difference]: Finished difference Result 45764 states and 134210 transitions. [2019-12-18 23:56:37,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:56:37,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-18 23:56:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:37,619 INFO L225 Difference]: With dead ends: 45764 [2019-12-18 23:56:37,619 INFO L226 Difference]: Without dead ends: 45764 [2019-12-18 23:56:37,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:56:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45764 states. [2019-12-18 23:56:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45764 to 37996. [2019-12-18 23:56:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37996 states. [2019-12-18 23:56:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37996 states to 37996 states and 110505 transitions. [2019-12-18 23:56:38,231 INFO L78 Accepts]: Start accepts. Automaton has 37996 states and 110505 transitions. Word has length 69 [2019-12-18 23:56:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:38,231 INFO L462 AbstractCegarLoop]: Abstraction has 37996 states and 110505 transitions. [2019-12-18 23:56:38,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:56:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 37996 states and 110505 transitions. [2019-12-18 23:56:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-18 23:56:38,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:38,247 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] [2019-12-18 23:56:38,247 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:38,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1005746969, now seen corresponding path program 1 times [2019-12-18 23:56:38,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:38,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287839327] [2019-12-18 23:56:38,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:38,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287839327] [2019-12-18 23:56:38,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:38,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:56:38,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268365741] [2019-12-18 23:56:38,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:56:38,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:38,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:56:38,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:56:38,327 INFO L87 Difference]: Start difference. First operand 37996 states and 110505 transitions. Second operand 5 states. [2019-12-18 23:56:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:38,868 INFO L93 Difference]: Finished difference Result 43056 states and 125055 transitions. [2019-12-18 23:56:38,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:56:38,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-18 23:56:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:38,940 INFO L225 Difference]: With dead ends: 43056 [2019-12-18 23:56:38,940 INFO L226 Difference]: Without dead ends: 43056 [2019-12-18 23:56:38,940 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-18 23:56:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43056 states. [2019-12-18 23:56:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43056 to 38407. [2019-12-18 23:56:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38407 states. [2019-12-18 23:56:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38407 states to 38407 states and 111610 transitions. [2019-12-18 23:56:39,665 INFO L78 Accepts]: Start accepts. Automaton has 38407 states and 111610 transitions. Word has length 75 [2019-12-18 23:56:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:39,666 INFO L462 AbstractCegarLoop]: Abstraction has 38407 states and 111610 transitions. [2019-12-18 23:56:39,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:56:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 38407 states and 111610 transitions. [2019-12-18 23:56:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-18 23:56:39,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:39,678 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] [2019-12-18 23:56:39,678 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1546409992, now seen corresponding path program 1 times [2019-12-18 23:56:39,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:39,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584054380] [2019-12-18 23:56:39,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:39,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584054380] [2019-12-18 23:56:39,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:39,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:56:39,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376928239] [2019-12-18 23:56:39,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:56:39,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:39,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:56:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:56:39,761 INFO L87 Difference]: Start difference. First operand 38407 states and 111610 transitions. Second operand 7 states. [2019-12-18 23:56:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:40,765 INFO L93 Difference]: Finished difference Result 42451 states and 122848 transitions. [2019-12-18 23:56:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:56:40,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-18 23:56:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:40,825 INFO L225 Difference]: With dead ends: 42451 [2019-12-18 23:56:40,825 INFO L226 Difference]: Without dead ends: 42374 [2019-12-18 23:56:40,825 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-18 23:56:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42374 states. [2019-12-18 23:56:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42374 to 35772. [2019-12-18 23:56:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35772 states. [2019-12-18 23:56:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35772 states to 35772 states and 105060 transitions. [2019-12-18 23:56:41,602 INFO L78 Accepts]: Start accepts. Automaton has 35772 states and 105060 transitions. Word has length 75 [2019-12-18 23:56:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:41,602 INFO L462 AbstractCegarLoop]: Abstraction has 35772 states and 105060 transitions. [2019-12-18 23:56:41,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:56:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 35772 states and 105060 transitions. [2019-12-18 23:56:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-18 23:56:41,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:41,614 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-18 23:56:41,614 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1806509476, now seen corresponding path program 1 times [2019-12-18 23:56:41,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:41,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330766403] [2019-12-18 23:56:41,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:41,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330766403] [2019-12-18 23:56:41,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:41,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:56:41,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796428633] [2019-12-18 23:56:41,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:56:41,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:56:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:56:41,691 INFO L87 Difference]: Start difference. First operand 35772 states and 105060 transitions. Second operand 7 states. [2019-12-18 23:56:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:42,862 INFO L93 Difference]: Finished difference Result 47965 states and 138281 transitions. [2019-12-18 23:56:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:56:42,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-18 23:56:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:42,931 INFO L225 Difference]: With dead ends: 47965 [2019-12-18 23:56:42,931 INFO L226 Difference]: Without dead ends: 47917 [2019-12-18 23:56:42,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:56:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47917 states. [2019-12-18 23:56:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47917 to 39863. [2019-12-18 23:56:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39863 states. [2019-12-18 23:56:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39863 states to 39863 states and 115528 transitions. [2019-12-18 23:56:43,489 INFO L78 Accepts]: Start accepts. Automaton has 39863 states and 115528 transitions. Word has length 77 [2019-12-18 23:56:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:43,490 INFO L462 AbstractCegarLoop]: Abstraction has 39863 states and 115528 transitions. [2019-12-18 23:56:43,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:56:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 39863 states and 115528 transitions. [2019-12-18 23:56:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-18 23:56:43,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:43,508 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] [2019-12-18 23:56:43,508 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:43,509 INFO L82 PathProgramCache]: Analyzing trace with hash -158428104, now seen corresponding path program 1 times [2019-12-18 23:56:43,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:43,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711227381] [2019-12-18 23:56:43,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:43,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711227381] [2019-12-18 23:56:43,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:43,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:56:43,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327929226] [2019-12-18 23:56:43,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:56:43,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:43,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:56:43,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:56:43,543 INFO L87 Difference]: Start difference. First operand 39863 states and 115528 transitions. Second operand 3 states. [2019-12-18 23:56:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:44,200 INFO L93 Difference]: Finished difference Result 48922 states and 139928 transitions. [2019-12-18 23:56:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:56:44,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-18 23:56:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:44,297 INFO L225 Difference]: With dead ends: 48922 [2019-12-18 23:56:44,297 INFO L226 Difference]: Without dead ends: 48922 [2019-12-18 23:56:44,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:56:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48922 states. [2019-12-18 23:56:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48922 to 45026. [2019-12-18 23:56:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45026 states. [2019-12-18 23:56:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45026 states to 45026 states and 129459 transitions. [2019-12-18 23:56:44,935 INFO L78 Accepts]: Start accepts. Automaton has 45026 states and 129459 transitions. Word has length 82 [2019-12-18 23:56:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:44,935 INFO L462 AbstractCegarLoop]: Abstraction has 45026 states and 129459 transitions. [2019-12-18 23:56:44,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:56:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 45026 states and 129459 transitions. [2019-12-18 23:56:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-18 23:56:44,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:44,964 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] [2019-12-18 23:56:44,965 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:44,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1134405531, now seen corresponding path program 1 times [2019-12-18 23:56:44,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:44,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419904745] [2019-12-18 23:56:44,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:45,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419904745] [2019-12-18 23:56:45,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:45,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:56:45,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806671972] [2019-12-18 23:56:45,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:56:45,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:56:45,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:56:45,027 INFO L87 Difference]: Start difference. First operand 45026 states and 129459 transitions. Second operand 4 states. [2019-12-18 23:56:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:45,442 INFO L93 Difference]: Finished difference Result 49702 states and 142198 transitions. [2019-12-18 23:56:45,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:56:45,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-18 23:56:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:45,514 INFO L225 Difference]: With dead ends: 49702 [2019-12-18 23:56:45,514 INFO L226 Difference]: Without dead ends: 49702 [2019-12-18 23:56:45,515 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-18 23:56:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49702 states. [2019-12-18 23:56:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49702 to 48859. [2019-12-18 23:56:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48859 states. [2019-12-18 23:56:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48859 states to 48859 states and 139766 transitions. [2019-12-18 23:56:46,418 INFO L78 Accepts]: Start accepts. Automaton has 48859 states and 139766 transitions. Word has length 83 [2019-12-18 23:56:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:46,418 INFO L462 AbstractCegarLoop]: Abstraction has 48859 states and 139766 transitions. [2019-12-18 23:56:46,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:56:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 48859 states and 139766 transitions. [2019-12-18 23:56:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-18 23:56:46,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:46,450 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] [2019-12-18 23:56:46,450 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:46,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1083352422, now seen corresponding path program 1 times [2019-12-18 23:56:46,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:46,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246207930] [2019-12-18 23:56:46,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:46,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246207930] [2019-12-18 23:56:46,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:46,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:56:46,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327711669] [2019-12-18 23:56:46,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:56:46,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:46,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:56:46,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:56:46,491 INFO L87 Difference]: Start difference. First operand 48859 states and 139766 transitions. Second operand 3 states. [2019-12-18 23:56:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:46,930 INFO L93 Difference]: Finished difference Result 59674 states and 167360 transitions. [2019-12-18 23:56:46,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:56:46,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-18 23:56:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:47,014 INFO L225 Difference]: With dead ends: 59674 [2019-12-18 23:56:47,014 INFO L226 Difference]: Without dead ends: 59674 [2019-12-18 23:56:47,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:56:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59674 states. [2019-12-18 23:56:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59674 to 55666. [2019-12-18 23:56:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55666 states. [2019-12-18 23:56:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55666 states to 55666 states and 157037 transitions. [2019-12-18 23:56:48,235 INFO L78 Accepts]: Start accepts. Automaton has 55666 states and 157037 transitions. Word has length 83 [2019-12-18 23:56:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:48,236 INFO L462 AbstractCegarLoop]: Abstraction has 55666 states and 157037 transitions. [2019-12-18 23:56:48,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:56:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 55666 states and 157037 transitions. [2019-12-18 23:56:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 23:56:48,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:48,265 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] [2019-12-18 23:56:48,265 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -707975427, now seen corresponding path program 1 times [2019-12-18 23:56:48,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:48,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619570180] [2019-12-18 23:56:48,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:48,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619570180] [2019-12-18 23:56:48,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:48,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:56:48,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531806642] [2019-12-18 23:56:48,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:56:48,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:48,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:56:48,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:56:48,355 INFO L87 Difference]: Start difference. First operand 55666 states and 157037 transitions. Second operand 6 states. [2019-12-18 23:56:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:49,202 INFO L93 Difference]: Finished difference Result 75375 states and 213827 transitions. [2019-12-18 23:56:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:56:49,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-18 23:56:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:49,315 INFO L225 Difference]: With dead ends: 75375 [2019-12-18 23:56:49,315 INFO L226 Difference]: Without dead ends: 75375 [2019-12-18 23:56:49,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:56:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75375 states. [2019-12-18 23:56:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75375 to 58282. [2019-12-18 23:56:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58282 states. [2019-12-18 23:56:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58282 states to 58282 states and 163127 transitions. [2019-12-18 23:56:50,188 INFO L78 Accepts]: Start accepts. Automaton has 58282 states and 163127 transitions. Word has length 84 [2019-12-18 23:56:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:50,188 INFO L462 AbstractCegarLoop]: Abstraction has 58282 states and 163127 transitions. [2019-12-18 23:56:50,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:56:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 58282 states and 163127 transitions. [2019-12-18 23:56:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 23:56:50,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:50,630 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] [2019-12-18 23:56:50,630 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:50,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash -496624514, now seen corresponding path program 1 times [2019-12-18 23:56:50,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:50,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784573929] [2019-12-18 23:56:50,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:50,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784573929] [2019-12-18 23:56:50,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:50,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:56:50,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199242652] [2019-12-18 23:56:50,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:56:50,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:56:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:56:50,696 INFO L87 Difference]: Start difference. First operand 58282 states and 163127 transitions. Second operand 5 states. [2019-12-18 23:56:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:51,368 INFO L93 Difference]: Finished difference Result 72853 states and 202231 transitions. [2019-12-18 23:56:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:56:51,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-18 23:56:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:51,471 INFO L225 Difference]: With dead ends: 72853 [2019-12-18 23:56:51,472 INFO L226 Difference]: Without dead ends: 72853 [2019-12-18 23:56:51,472 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-18 23:56:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72853 states. [2019-12-18 23:56:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72853 to 59114. [2019-12-18 23:56:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-12-18 23:56:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 164968 transitions. [2019-12-18 23:56:52,315 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 164968 transitions. Word has length 84 [2019-12-18 23:56:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:52,315 INFO L462 AbstractCegarLoop]: Abstraction has 59114 states and 164968 transitions. [2019-12-18 23:56:52,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:56:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 164968 transitions. [2019-12-18 23:56:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 23:56:52,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:52,347 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] [2019-12-18 23:56:52,347 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:52,347 INFO L82 PathProgramCache]: Analyzing trace with hash -751361059, now seen corresponding path program 1 times [2019-12-18 23:56:52,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:52,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191295363] [2019-12-18 23:56:52,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:52,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191295363] [2019-12-18 23:56:52,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:52,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:56:52,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392265533] [2019-12-18 23:56:52,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:56:52,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:52,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:56:52,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:56:52,412 INFO L87 Difference]: Start difference. First operand 59114 states and 164968 transitions. Second operand 5 states. [2019-12-18 23:56:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:53,858 INFO L93 Difference]: Finished difference Result 65995 states and 181821 transitions. [2019-12-18 23:56:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:56:53,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-18 23:56:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:53,946 INFO L225 Difference]: With dead ends: 65995 [2019-12-18 23:56:53,946 INFO L226 Difference]: Without dead ends: 65995 [2019-12-18 23:56:53,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:56:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65995 states. [2019-12-18 23:56:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65995 to 63926. [2019-12-18 23:56:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63926 states. [2019-12-18 23:56:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63926 states to 63926 states and 176924 transitions. [2019-12-18 23:56:54,792 INFO L78 Accepts]: Start accepts. Automaton has 63926 states and 176924 transitions. Word has length 84 [2019-12-18 23:56:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:56:54,792 INFO L462 AbstractCegarLoop]: Abstraction has 63926 states and 176924 transitions. [2019-12-18 23:56:54,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:56:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 63926 states and 176924 transitions. [2019-12-18 23:56:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 23:56:54,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:56:54,827 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] [2019-12-18 23:56:54,827 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:56:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:56:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash 493403422, now seen corresponding path program 1 times [2019-12-18 23:56:54,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:56:54,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738098409] [2019-12-18 23:56:54,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:56:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:56:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:56:54,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738098409] [2019-12-18 23:56:54,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:56:54,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:56:54,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939190374] [2019-12-18 23:56:54,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:56:54,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:56:54,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:56:54,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:56:54,946 INFO L87 Difference]: Start difference. First operand 63926 states and 176924 transitions. Second operand 8 states. [2019-12-18 23:56:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:56:57,751 INFO L93 Difference]: Finished difference Result 92718 states and 257042 transitions. [2019-12-18 23:56:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:56:57,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-18 23:56:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:56:57,982 INFO L225 Difference]: With dead ends: 92718 [2019-12-18 23:56:57,982 INFO L226 Difference]: Without dead ends: 92400 [2019-12-18 23:56:57,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:56:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92400 states. [2019-12-18 23:56:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92400 to 84076. [2019-12-18 23:56:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84076 states. [2019-12-18 23:57:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84076 states to 84076 states and 232976 transitions. [2019-12-18 23:57:00,042 INFO L78 Accepts]: Start accepts. Automaton has 84076 states and 232976 transitions. Word has length 84 [2019-12-18 23:57:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:00,042 INFO L462 AbstractCegarLoop]: Abstraction has 84076 states and 232976 transitions. [2019-12-18 23:57:00,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:57:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 84076 states and 232976 transitions. [2019-12-18 23:57:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 23:57:00,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:00,087 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] [2019-12-18 23:57:00,087 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1303547937, now seen corresponding path program 1 times [2019-12-18 23:57:00,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:00,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52891427] [2019-12-18 23:57:00,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:00,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52891427] [2019-12-18 23:57:00,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:00,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:57:00,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464628705] [2019-12-18 23:57:00,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:57:00,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:00,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:57:00,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:57:00,195 INFO L87 Difference]: Start difference. First operand 84076 states and 232976 transitions. Second operand 8 states. [2019-12-18 23:57:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:03,379 INFO L93 Difference]: Finished difference Result 201342 states and 566165 transitions. [2019-12-18 23:57:03,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 23:57:03,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-18 23:57:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:03,744 INFO L225 Difference]: With dead ends: 201342 [2019-12-18 23:57:03,744 INFO L226 Difference]: Without dead ends: 201234 [2019-12-18 23:57:03,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:57:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201234 states. [2019-12-18 23:57:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201234 to 117759. [2019-12-18 23:57:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117759 states. [2019-12-18 23:57:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117759 states to 117759 states and 331079 transitions. [2019-12-18 23:57:06,522 INFO L78 Accepts]: Start accepts. Automaton has 117759 states and 331079 transitions. Word has length 84 [2019-12-18 23:57:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:06,523 INFO L462 AbstractCegarLoop]: Abstraction has 117759 states and 331079 transitions. [2019-12-18 23:57:06,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:57:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 117759 states and 331079 transitions. [2019-12-18 23:57:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 23:57:06,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:06,584 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] [2019-12-18 23:57:06,584 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:06,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash -416044256, now seen corresponding path program 1 times [2019-12-18 23:57:06,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:06,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715708931] [2019-12-18 23:57:06,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:06,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715708931] [2019-12-18 23:57:06,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:06,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:57:06,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677846154] [2019-12-18 23:57:06,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:57:06,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:06,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:57:06,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:57:06,699 INFO L87 Difference]: Start difference. First operand 117759 states and 331079 transitions. Second operand 7 states. [2019-12-18 23:57:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:07,788 INFO L93 Difference]: Finished difference Result 151166 states and 427927 transitions. [2019-12-18 23:57:07,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:57:07,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-12-18 23:57:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:08,049 INFO L225 Difference]: With dead ends: 151166 [2019-12-18 23:57:08,049 INFO L226 Difference]: Without dead ends: 151166 [2019-12-18 23:57:08,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 23:57:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151166 states. [2019-12-18 23:57:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151166 to 103922. [2019-12-18 23:57:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103922 states. [2019-12-18 23:57:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103922 states to 103922 states and 288332 transitions. [2019-12-18 23:57:10,471 INFO L78 Accepts]: Start accepts. Automaton has 103922 states and 288332 transitions. Word has length 84 [2019-12-18 23:57:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:10,472 INFO L462 AbstractCegarLoop]: Abstraction has 103922 states and 288332 transitions. [2019-12-18 23:57:10,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:57:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 103922 states and 288332 transitions. [2019-12-18 23:57:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 23:57:10,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:10,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:10,520 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:10,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:10,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2146947488, now seen corresponding path program 1 times [2019-12-18 23:57:10,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:10,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538261242] [2019-12-18 23:57:10,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:10,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538261242] [2019-12-18 23:57:10,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:10,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 23:57:10,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978150744] [2019-12-18 23:57:10,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:57:10,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:57:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:57:10,626 INFO L87 Difference]: Start difference. First operand 103922 states and 288332 transitions. Second operand 9 states. [2019-12-18 23:57:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:12,766 INFO L93 Difference]: Finished difference Result 119728 states and 331026 transitions. [2019-12-18 23:57:12,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:57:12,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-12-18 23:57:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:12,959 INFO L225 Difference]: With dead ends: 119728 [2019-12-18 23:57:12,959 INFO L226 Difference]: Without dead ends: 119728 [2019-12-18 23:57:12,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:57:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119728 states. [2019-12-18 23:57:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119728 to 106034. [2019-12-18 23:57:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106034 states. [2019-12-18 23:57:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106034 states to 106034 states and 294177 transitions. [2019-12-18 23:57:15,060 INFO L78 Accepts]: Start accepts. Automaton has 106034 states and 294177 transitions. Word has length 84 [2019-12-18 23:57:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:15,061 INFO L462 AbstractCegarLoop]: Abstraction has 106034 states and 294177 transitions. [2019-12-18 23:57:15,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:57:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 106034 states and 294177 transitions. [2019-12-18 23:57:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 23:57:15,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:15,109 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] [2019-12-18 23:57:15,109 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1260516127, now seen corresponding path program 1 times [2019-12-18 23:57:15,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:15,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480513880] [2019-12-18 23:57:15,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:15,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480513880] [2019-12-18 23:57:15,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:15,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:57:15,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164205108] [2019-12-18 23:57:15,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:57:15,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:15,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:57:15,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:57:15,169 INFO L87 Difference]: Start difference. First operand 106034 states and 294177 transitions. Second operand 3 states. [2019-12-18 23:57:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:15,460 INFO L93 Difference]: Finished difference Result 88913 states and 238261 transitions. [2019-12-18 23:57:15,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:57:15,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-18 23:57:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:15,583 INFO L225 Difference]: With dead ends: 88913 [2019-12-18 23:57:15,584 INFO L226 Difference]: Without dead ends: 88766 [2019-12-18 23:57:15,584 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-18 23:57:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88766 states. [2019-12-18 23:57:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88766 to 67685. [2019-12-18 23:57:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67685 states. [2019-12-18 23:57:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67685 states to 67685 states and 179345 transitions. [2019-12-18 23:57:17,038 INFO L78 Accepts]: Start accepts. Automaton has 67685 states and 179345 transitions. Word has length 84 [2019-12-18 23:57:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:17,038 INFO L462 AbstractCegarLoop]: Abstraction has 67685 states and 179345 transitions. [2019-12-18 23:57:17,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:57:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 67685 states and 179345 transitions. [2019-12-18 23:57:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 23:57:17,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:17,072 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] [2019-12-18 23:57:17,072 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:17,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:17,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1843781970, now seen corresponding path program 1 times [2019-12-18 23:57:17,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:17,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131929371] [2019-12-18 23:57:17,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:17,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131929371] [2019-12-18 23:57:17,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:17,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:57:17,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158485735] [2019-12-18 23:57:17,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:57:17,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:17,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:57:17,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:57:17,155 INFO L87 Difference]: Start difference. First operand 67685 states and 179345 transitions. Second operand 8 states. [2019-12-18 23:57:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:20,433 INFO L93 Difference]: Finished difference Result 177080 states and 472623 transitions. [2019-12-18 23:57:20,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 23:57:20,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-12-18 23:57:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:21,230 INFO L225 Difference]: With dead ends: 177080 [2019-12-18 23:57:21,230 INFO L226 Difference]: Without dead ends: 176324 [2019-12-18 23:57:21,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-18 23:57:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176324 states. [2019-12-18 23:57:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176324 to 103397. [2019-12-18 23:57:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103397 states. [2019-12-18 23:57:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103397 states to 103397 states and 276153 transitions. [2019-12-18 23:57:23,766 INFO L78 Accepts]: Start accepts. Automaton has 103397 states and 276153 transitions. Word has length 85 [2019-12-18 23:57:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:23,767 INFO L462 AbstractCegarLoop]: Abstraction has 103397 states and 276153 transitions. [2019-12-18 23:57:23,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:57:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 103397 states and 276153 transitions. [2019-12-18 23:57:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 23:57:23,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:23,810 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] [2019-12-18 23:57:23,810 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:23,810 INFO L82 PathProgramCache]: Analyzing trace with hash 654233967, now seen corresponding path program 1 times [2019-12-18 23:57:23,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:23,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119416424] [2019-12-18 23:57:23,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:23,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119416424] [2019-12-18 23:57:23,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:23,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:57:23,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370124818] [2019-12-18 23:57:23,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:57:23,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:23,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:57:23,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:57:23,959 INFO L87 Difference]: Start difference. First operand 103397 states and 276153 transitions. Second operand 7 states. [2019-12-18 23:57:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:24,794 INFO L93 Difference]: Finished difference Result 129583 states and 344000 transitions. [2019-12-18 23:57:24,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:57:24,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-18 23:57:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:25,000 INFO L225 Difference]: With dead ends: 129583 [2019-12-18 23:57:25,001 INFO L226 Difference]: Without dead ends: 129569 [2019-12-18 23:57:25,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:57:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129569 states. [2019-12-18 23:57:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129569 to 113414. [2019-12-18 23:57:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113414 states. [2019-12-18 23:57:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113414 states to 113414 states and 302655 transitions. [2019-12-18 23:57:27,273 INFO L78 Accepts]: Start accepts. Automaton has 113414 states and 302655 transitions. Word has length 85 [2019-12-18 23:57:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:27,274 INFO L462 AbstractCegarLoop]: Abstraction has 113414 states and 302655 transitions. [2019-12-18 23:57:27,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:57:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 113414 states and 302655 transitions. [2019-12-18 23:57:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 23:57:27,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:27,321 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] [2019-12-18 23:57:27,321 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1422975376, now seen corresponding path program 1 times [2019-12-18 23:57:27,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:27,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703323402] [2019-12-18 23:57:27,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:27,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703323402] [2019-12-18 23:57:27,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:27,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:57:27,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216887280] [2019-12-18 23:57:27,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:57:27,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:27,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:57:27,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:57:27,421 INFO L87 Difference]: Start difference. First operand 113414 states and 302655 transitions. Second operand 7 states. [2019-12-18 23:57:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:28,890 INFO L93 Difference]: Finished difference Result 131592 states and 349080 transitions. [2019-12-18 23:57:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:57:28,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-18 23:57:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:29,188 INFO L225 Difference]: With dead ends: 131592 [2019-12-18 23:57:29,188 INFO L226 Difference]: Without dead ends: 131592 [2019-12-18 23:57:29,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:57:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131592 states. [2019-12-18 23:57:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131592 to 114610. [2019-12-18 23:57:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114610 states. [2019-12-18 23:57:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114610 states to 114610 states and 305653 transitions. [2019-12-18 23:57:31,487 INFO L78 Accepts]: Start accepts. Automaton has 114610 states and 305653 transitions. Word has length 85 [2019-12-18 23:57:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:31,487 INFO L462 AbstractCegarLoop]: Abstraction has 114610 states and 305653 transitions. [2019-12-18 23:57:31,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:57:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 114610 states and 305653 transitions. [2019-12-18 23:57:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 23:57:31,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:31,533 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] [2019-12-18 23:57:31,533 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash 585326896, now seen corresponding path program 1 times [2019-12-18 23:57:31,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:31,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098325338] [2019-12-18 23:57:31,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:31,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098325338] [2019-12-18 23:57:31,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:31,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:57:31,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970308574] [2019-12-18 23:57:31,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:57:31,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:31,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:57:31,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:57:31,595 INFO L87 Difference]: Start difference. First operand 114610 states and 305653 transitions. Second operand 4 states. [2019-12-18 23:57:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:32,832 INFO L93 Difference]: Finished difference Result 134347 states and 361219 transitions. [2019-12-18 23:57:32,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:57:32,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-18 23:57:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:33,046 INFO L225 Difference]: With dead ends: 134347 [2019-12-18 23:57:33,047 INFO L226 Difference]: Without dead ends: 134011 [2019-12-18 23:57:33,047 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-18 23:57:33,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134011 states. [2019-12-18 23:57:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134011 to 119814. [2019-12-18 23:57:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119814 states. [2019-12-18 23:57:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119814 states to 119814 states and 321024 transitions. [2019-12-18 23:57:35,399 INFO L78 Accepts]: Start accepts. Automaton has 119814 states and 321024 transitions. Word has length 85 [2019-12-18 23:57:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:35,400 INFO L462 AbstractCegarLoop]: Abstraction has 119814 states and 321024 transitions. [2019-12-18 23:57:35,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:57:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 119814 states and 321024 transitions. [2019-12-18 23:57:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 23:57:35,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:35,449 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] [2019-12-18 23:57:35,449 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1211624463, now seen corresponding path program 1 times [2019-12-18 23:57:35,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:35,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534222975] [2019-12-18 23:57:35,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:35,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534222975] [2019-12-18 23:57:35,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:35,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:57:35,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455980584] [2019-12-18 23:57:35,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:57:35,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:35,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:57:35,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:57:35,579 INFO L87 Difference]: Start difference. First operand 119814 states and 321024 transitions. Second operand 7 states. [2019-12-18 23:57:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:37,240 INFO L93 Difference]: Finished difference Result 122135 states and 320393 transitions. [2019-12-18 23:57:37,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:57:37,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-18 23:57:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:37,420 INFO L225 Difference]: With dead ends: 122135 [2019-12-18 23:57:37,420 INFO L226 Difference]: Without dead ends: 122135 [2019-12-18 23:57:37,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:57:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122135 states. [2019-12-18 23:57:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122135 to 86107. [2019-12-18 23:57:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86107 states. [2019-12-18 23:57:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86107 states to 86107 states and 222856 transitions. [2019-12-18 23:57:38,734 INFO L78 Accepts]: Start accepts. Automaton has 86107 states and 222856 transitions. Word has length 85 [2019-12-18 23:57:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:38,734 INFO L462 AbstractCegarLoop]: Abstraction has 86107 states and 222856 transitions. [2019-12-18 23:57:38,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:57:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 86107 states and 222856 transitions. [2019-12-18 23:57:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 23:57:38,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:38,771 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] [2019-12-18 23:57:38,771 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash -324120782, now seen corresponding path program 1 times [2019-12-18 23:57:38,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:38,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593696708] [2019-12-18 23:57:38,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:38,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593696708] [2019-12-18 23:57:38,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:38,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:57:38,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898495994] [2019-12-18 23:57:38,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:57:38,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:57:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:57:38,855 INFO L87 Difference]: Start difference. First operand 86107 states and 222856 transitions. Second operand 5 states. [2019-12-18 23:57:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:39,003 INFO L93 Difference]: Finished difference Result 45289 states and 104531 transitions. [2019-12-18 23:57:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:57:39,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-18 23:57:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:39,048 INFO L225 Difference]: With dead ends: 45289 [2019-12-18 23:57:39,048 INFO L226 Difference]: Without dead ends: 42088 [2019-12-18 23:57:39,048 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-18 23:57:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42088 states. [2019-12-18 23:57:39,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42088 to 34955. [2019-12-18 23:57:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34955 states. [2019-12-18 23:57:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34955 states to 34955 states and 80123 transitions. [2019-12-18 23:57:39,852 INFO L78 Accepts]: Start accepts. Automaton has 34955 states and 80123 transitions. Word has length 85 [2019-12-18 23:57:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:39,852 INFO L462 AbstractCegarLoop]: Abstraction has 34955 states and 80123 transitions. [2019-12-18 23:57:39,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:57:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 34955 states and 80123 transitions. [2019-12-18 23:57:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:39,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:39,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:39,884 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:39,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:39,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1251711441, now seen corresponding path program 1 times [2019-12-18 23:57:39,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:39,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279722754] [2019-12-18 23:57:39,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:39,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279722754] [2019-12-18 23:57:39,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:39,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:57:39,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967423163] [2019-12-18 23:57:39,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:57:39,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:39,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:57:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:57:39,960 INFO L87 Difference]: Start difference. First operand 34955 states and 80123 transitions. Second operand 5 states. [2019-12-18 23:57:40,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:40,420 INFO L93 Difference]: Finished difference Result 38835 states and 88447 transitions. [2019-12-18 23:57:40,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:57:40,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-18 23:57:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:40,460 INFO L225 Difference]: With dead ends: 38835 [2019-12-18 23:57:40,460 INFO L226 Difference]: Without dead ends: 38793 [2019-12-18 23:57:40,460 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-18 23:57:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38793 states. [2019-12-18 23:57:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38793 to 36305. [2019-12-18 23:57:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36305 states. [2019-12-18 23:57:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36305 states to 36305 states and 83084 transitions. [2019-12-18 23:57:40,876 INFO L78 Accepts]: Start accepts. Automaton has 36305 states and 83084 transitions. Word has length 114 [2019-12-18 23:57:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:40,877 INFO L462 AbstractCegarLoop]: Abstraction has 36305 states and 83084 transitions. [2019-12-18 23:57:40,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:57:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 36305 states and 83084 transitions. [2019-12-18 23:57:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:40,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:40,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:40,912 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:40,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:40,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1132645485, now seen corresponding path program 1 times [2019-12-18 23:57:40,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:40,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088361496] [2019-12-18 23:57:40,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:41,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088361496] [2019-12-18 23:57:41,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:41,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:57:41,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432303433] [2019-12-18 23:57:41,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:57:41,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:41,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:57:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:57:41,013 INFO L87 Difference]: Start difference. First operand 36305 states and 83084 transitions. Second operand 7 states. [2019-12-18 23:57:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:41,492 INFO L93 Difference]: Finished difference Result 37037 states and 84862 transitions. [2019-12-18 23:57:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:57:41,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2019-12-18 23:57:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:41,533 INFO L225 Difference]: With dead ends: 37037 [2019-12-18 23:57:41,533 INFO L226 Difference]: Without dead ends: 37037 [2019-12-18 23:57:41,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-18 23:57:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37037 states. [2019-12-18 23:57:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37037 to 36151. [2019-12-18 23:57:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36151 states. [2019-12-18 23:57:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36151 states to 36151 states and 82766 transitions. [2019-12-18 23:57:41,943 INFO L78 Accepts]: Start accepts. Automaton has 36151 states and 82766 transitions. Word has length 114 [2019-12-18 23:57:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:41,944 INFO L462 AbstractCegarLoop]: Abstraction has 36151 states and 82766 transitions. [2019-12-18 23:57:41,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:57:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 36151 states and 82766 transitions. [2019-12-18 23:57:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:41,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:41,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:41,978 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:41,979 INFO L82 PathProgramCache]: Analyzing trace with hash 861451702, now seen corresponding path program 1 times [2019-12-18 23:57:41,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:41,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867229862] [2019-12-18 23:57:41,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:42,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867229862] [2019-12-18 23:57:42,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:42,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 23:57:42,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967234132] [2019-12-18 23:57:42,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:57:42,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:42,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:57:42,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:57:42,122 INFO L87 Difference]: Start difference. First operand 36151 states and 82766 transitions. Second operand 9 states. [2019-12-18 23:57:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:43,133 INFO L93 Difference]: Finished difference Result 40956 states and 92978 transitions. [2019-12-18 23:57:43,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:57:43,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-12-18 23:57:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:43,176 INFO L225 Difference]: With dead ends: 40956 [2019-12-18 23:57:43,176 INFO L226 Difference]: Without dead ends: 40888 [2019-12-18 23:57:43,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:57:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40888 states. [2019-12-18 23:57:43,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40888 to 37968. [2019-12-18 23:57:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37968 states. [2019-12-18 23:57:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37968 states to 37968 states and 86465 transitions. [2019-12-18 23:57:43,614 INFO L78 Accepts]: Start accepts. Automaton has 37968 states and 86465 transitions. Word has length 114 [2019-12-18 23:57:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:43,615 INFO L462 AbstractCegarLoop]: Abstraction has 37968 states and 86465 transitions. [2019-12-18 23:57:43,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:57:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37968 states and 86465 transitions. [2019-12-18 23:57:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:43,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:43,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:43,649 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:43,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1748955383, now seen corresponding path program 1 times [2019-12-18 23:57:43,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:43,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182830105] [2019-12-18 23:57:43,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:43,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182830105] [2019-12-18 23:57:43,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:43,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:57:43,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665170205] [2019-12-18 23:57:43,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:57:43,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:43,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:57:43,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:57:43,717 INFO L87 Difference]: Start difference. First operand 37968 states and 86465 transitions. Second operand 4 states. [2019-12-18 23:57:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:44,096 INFO L93 Difference]: Finished difference Result 39330 states and 89165 transitions. [2019-12-18 23:57:44,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:57:44,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-18 23:57:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:44,162 INFO L225 Difference]: With dead ends: 39330 [2019-12-18 23:57:44,162 INFO L226 Difference]: Without dead ends: 39330 [2019-12-18 23:57:44,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:57:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39330 states. [2019-12-18 23:57:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39330 to 36867. [2019-12-18 23:57:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36867 states. [2019-12-18 23:57:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36867 states to 36867 states and 83911 transitions. [2019-12-18 23:57:44,763 INFO L78 Accepts]: Start accepts. Automaton has 36867 states and 83911 transitions. Word has length 114 [2019-12-18 23:57:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:44,763 INFO L462 AbstractCegarLoop]: Abstraction has 36867 states and 83911 transitions. [2019-12-18 23:57:44,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:57:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 36867 states and 83911 transitions. [2019-12-18 23:57:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:44,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:44,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:44,797 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:44,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:44,798 INFO L82 PathProgramCache]: Analyzing trace with hash -959357803, now seen corresponding path program 2 times [2019-12-18 23:57:44,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:44,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282049232] [2019-12-18 23:57:44,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:44,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282049232] [2019-12-18 23:57:44,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:44,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:57:44,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377501632] [2019-12-18 23:57:44,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:57:44,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:44,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:57:44,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:57:44,870 INFO L87 Difference]: Start difference. First operand 36867 states and 83911 transitions. Second operand 5 states. [2019-12-18 23:57:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:45,260 INFO L93 Difference]: Finished difference Result 39528 states and 89525 transitions. [2019-12-18 23:57:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:57:45,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-18 23:57:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:45,304 INFO L225 Difference]: With dead ends: 39528 [2019-12-18 23:57:45,305 INFO L226 Difference]: Without dead ends: 39528 [2019-12-18 23:57:45,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:57:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39528 states. [2019-12-18 23:57:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39528 to 36824. [2019-12-18 23:57:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36824 states. [2019-12-18 23:57:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36824 states to 36824 states and 83736 transitions. [2019-12-18 23:57:45,889 INFO L78 Accepts]: Start accepts. Automaton has 36824 states and 83736 transitions. Word has length 114 [2019-12-18 23:57:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:45,890 INFO L462 AbstractCegarLoop]: Abstraction has 36824 states and 83736 transitions. [2019-12-18 23:57:45,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:57:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 36824 states and 83736 transitions. [2019-12-18 23:57:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:45,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:45,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:45,924 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1036717853, now seen corresponding path program 3 times [2019-12-18 23:57:45,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:45,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844263518] [2019-12-18 23:57:45,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:45,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844263518] [2019-12-18 23:57:45,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:45,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:57:45,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040263659] [2019-12-18 23:57:45,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:57:45,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:45,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:57:45,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:57:45,975 INFO L87 Difference]: Start difference. First operand 36824 states and 83736 transitions. Second operand 3 states. [2019-12-18 23:57:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:46,087 INFO L93 Difference]: Finished difference Result 47385 states and 106780 transitions. [2019-12-18 23:57:46,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:57:46,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-12-18 23:57:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:46,136 INFO L225 Difference]: With dead ends: 47385 [2019-12-18 23:57:46,136 INFO L226 Difference]: Without dead ends: 47385 [2019-12-18 23:57:46,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:57:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47385 states. [2019-12-18 23:57:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47385 to 46837. [2019-12-18 23:57:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46837 states. [2019-12-18 23:57:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46837 states to 46837 states and 105603 transitions. [2019-12-18 23:57:46,651 INFO L78 Accepts]: Start accepts. Automaton has 46837 states and 105603 transitions. Word has length 114 [2019-12-18 23:57:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:46,651 INFO L462 AbstractCegarLoop]: Abstraction has 46837 states and 105603 transitions. [2019-12-18 23:57:46,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:57:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 46837 states and 105603 transitions. [2019-12-18 23:57:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:46,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:46,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:46,697 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:46,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1074572516, now seen corresponding path program 1 times [2019-12-18 23:57:46,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:46,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745910030] [2019-12-18 23:57:46,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:46,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745910030] [2019-12-18 23:57:46,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:46,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:57:46,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842858241] [2019-12-18 23:57:46,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:57:46,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:46,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:57:46,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:57:46,781 INFO L87 Difference]: Start difference. First operand 46837 states and 105603 transitions. Second operand 6 states. [2019-12-18 23:57:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:47,329 INFO L93 Difference]: Finished difference Result 53240 states and 119013 transitions. [2019-12-18 23:57:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:57:47,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-18 23:57:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:47,387 INFO L225 Difference]: With dead ends: 53240 [2019-12-18 23:57:47,388 INFO L226 Difference]: Without dead ends: 53240 [2019-12-18 23:57:47,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:57:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53240 states. [2019-12-18 23:57:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53240 to 48199. [2019-12-18 23:57:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48199 states. [2019-12-18 23:57:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48199 states to 48199 states and 108396 transitions. [2019-12-18 23:57:48,315 INFO L78 Accepts]: Start accepts. Automaton has 48199 states and 108396 transitions. Word has length 114 [2019-12-18 23:57:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:48,316 INFO L462 AbstractCegarLoop]: Abstraction has 48199 states and 108396 transitions. [2019-12-18 23:57:48,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:57:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 48199 states and 108396 transitions. [2019-12-18 23:57:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:48,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:48,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:48,377 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:48,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:48,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1878594116, now seen corresponding path program 1 times [2019-12-18 23:57:48,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:48,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685544517] [2019-12-18 23:57:48,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:48,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685544517] [2019-12-18 23:57:48,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:48,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:57:48,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235012519] [2019-12-18 23:57:48,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:57:48,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:48,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:57:48,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:57:48,438 INFO L87 Difference]: Start difference. First operand 48199 states and 108396 transitions. Second operand 5 states. [2019-12-18 23:57:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:48,967 INFO L93 Difference]: Finished difference Result 50626 states and 113529 transitions. [2019-12-18 23:57:48,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:57:48,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-18 23:57:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:49,022 INFO L225 Difference]: With dead ends: 50626 [2019-12-18 23:57:49,022 INFO L226 Difference]: Without dead ends: 50626 [2019-12-18 23:57:49,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:57:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50626 states. [2019-12-18 23:57:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50626 to 46988. [2019-12-18 23:57:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46988 states. [2019-12-18 23:57:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46988 states to 46988 states and 105609 transitions. [2019-12-18 23:57:49,548 INFO L78 Accepts]: Start accepts. Automaton has 46988 states and 105609 transitions. Word has length 114 [2019-12-18 23:57:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:49,548 INFO L462 AbstractCegarLoop]: Abstraction has 46988 states and 105609 transitions. [2019-12-18 23:57:49,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:57:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 46988 states and 105609 transitions. [2019-12-18 23:57:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:49,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:49,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:49,591 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:49,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1955954166, now seen corresponding path program 2 times [2019-12-18 23:57:49,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:49,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981786117] [2019-12-18 23:57:49,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:49,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981786117] [2019-12-18 23:57:49,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:49,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:57:49,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418265825] [2019-12-18 23:57:49,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:57:49,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:49,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:57:49,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:57:49,675 INFO L87 Difference]: Start difference. First operand 46988 states and 105609 transitions. Second operand 6 states. [2019-12-18 23:57:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:50,415 INFO L93 Difference]: Finished difference Result 52827 states and 117945 transitions. [2019-12-18 23:57:50,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:57:50,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-18 23:57:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:50,472 INFO L225 Difference]: With dead ends: 52827 [2019-12-18 23:57:50,472 INFO L226 Difference]: Without dead ends: 52827 [2019-12-18 23:57:50,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:57:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52827 states. [2019-12-18 23:57:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52827 to 45268. [2019-12-18 23:57:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45268 states. [2019-12-18 23:57:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45268 states to 45268 states and 101781 transitions. [2019-12-18 23:57:51,005 INFO L78 Accepts]: Start accepts. Automaton has 45268 states and 101781 transitions. Word has length 114 [2019-12-18 23:57:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:51,005 INFO L462 AbstractCegarLoop]: Abstraction has 45268 states and 101781 transitions. [2019-12-18 23:57:51,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:57:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 45268 states and 101781 transitions. [2019-12-18 23:57:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:51,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:51,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:51,048 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1307615315, now seen corresponding path program 4 times [2019-12-18 23:57:51,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:51,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164734934] [2019-12-18 23:57:51,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:51,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164734934] [2019-12-18 23:57:51,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:51,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:57:51,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260424084] [2019-12-18 23:57:51,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:57:51,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:51,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:57:51,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:57:51,430 INFO L87 Difference]: Start difference. First operand 45268 states and 101781 transitions. Second operand 6 states. [2019-12-18 23:57:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:52,121 INFO L93 Difference]: Finished difference Result 52374 states and 117292 transitions. [2019-12-18 23:57:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 23:57:52,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-18 23:57:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:52,178 INFO L225 Difference]: With dead ends: 52374 [2019-12-18 23:57:52,178 INFO L226 Difference]: Without dead ends: 52374 [2019-12-18 23:57:52,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 23:57:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52374 states. [2019-12-18 23:57:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52374 to 44957. [2019-12-18 23:57:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44957 states. [2019-12-18 23:57:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44957 states to 44957 states and 101031 transitions. [2019-12-18 23:57:52,711 INFO L78 Accepts]: Start accepts. Automaton has 44957 states and 101031 transitions. Word has length 114 [2019-12-18 23:57:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:57:52,711 INFO L462 AbstractCegarLoop]: Abstraction has 44957 states and 101031 transitions. [2019-12-18 23:57:52,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:57:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 44957 states and 101031 transitions. [2019-12-18 23:57:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-18 23:57:52,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:57:52,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:57:52,752 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:57:52,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:57:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1775984004, now seen corresponding path program 2 times [2019-12-18 23:57:52,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:57:52,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333237319] [2019-12-18 23:57:52,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:57:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:57:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:57:52,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333237319] [2019-12-18 23:57:52,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:57:52,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:57:52,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392769395] [2019-12-18 23:57:52,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:57:52,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:57:52,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:57:52,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:57:52,814 INFO L87 Difference]: Start difference. First operand 44957 states and 101031 transitions. Second operand 5 states. [2019-12-18 23:57:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:57:53,291 INFO L93 Difference]: Finished difference Result 45904 states and 102982 transitions. [2019-12-18 23:57:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:57:53,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-18 23:57:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:57:53,340 INFO L225 Difference]: With dead ends: 45904 [2019-12-18 23:57:53,340 INFO L226 Difference]: Without dead ends: 45904 [2019-12-18 23:57:53,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:57:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45904 states. [2019-12-18 23:57:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45904 to 45105. [2019-12-18 23:57:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45105 states. Received shutdown request... [2019-12-18 23:57:53,779 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 23:57:53,784 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 23:57:53,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:57:53 BasicIcfg [2019-12-18 23:57:53,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:57:53,786 INFO L168 Benchmark]: Toolchain (without parser) took 195526.22 ms. Allocated memory was 137.4 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 100.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 23:57:53,787 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 23:57:53,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.38 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.2 MB in the beginning and 155.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:57:53,788 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.37 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 151.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:57:53,788 INFO L168 Benchmark]: Boogie Preprocessor took 43.42 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 149.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 23:57:53,789 INFO L168 Benchmark]: RCFGBuilder took 986.48 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 93.2 MB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:57:53,789 INFO L168 Benchmark]: TraceAbstraction took 193631.37 ms. Allocated memory was 202.4 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 92.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 23:57:53,791 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.38 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.2 MB in the beginning and 155.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.37 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 151.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.42 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 149.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 986.48 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 93.2 MB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193631.37 ms. Allocated memory was 202.4 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 92.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while ReachableStatesComputation was computing reachable states (11276 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while ReachableStatesComputation was computing reachable states (11276 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: TIMEOUT, OverallTime: 193.3s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 82.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 19101 SDtfs, 21809 SDslu, 42891 SDs, 0 SdLazy, 19938 SolverSat, 1024 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 142 SyntacticMatches, 35 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278543occurred 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: 90.7s AutomataMinimizationTime, 42 MinimizatonAttempts, 563782 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3510 NumberOfCodeBlocks, 3510 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3468 ConstructedInterpolants, 0 QuantifiedInterpolants, 686088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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 could not prove your program: Timeout Completed graceful shutdown