/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:44:41,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:44:41,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:44:41,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:44:41,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:44:41,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:44:41,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:44:41,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:44:41,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:44:41,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:44:41,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:44:41,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:44:41,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:44:41,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:44:41,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:44:41,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:44:41,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:44:41,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:44:41,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:44:41,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:44:41,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:44:41,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:44:41,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:44:41,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:44:41,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:44:41,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:44:41,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:44:41,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:44:41,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:44:41,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:44:41,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:44:41,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:44:41,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:44:41,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:44:41,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:44:41,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:44:41,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:44:41,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:44:41,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:44:41,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:44:41,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:44:41,138 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-SemanticLbe-MCR.epf [2019-12-27 16:44:41,159 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:44:41,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:44:41,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:44:41,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:44:41,164 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:44:41,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:44:41,165 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:44:41,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:44:41,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:44:41,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:44:41,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:44:41,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:44:41,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:44:41,167 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:44:41,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:44:41,168 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:44:41,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:44:41,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:44:41,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:44:41,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:44:41,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:44:41,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:44:41,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:44:41,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:44:41,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:44:41,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:44:41,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:44:41,171 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:44:41,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:44:41,171 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:44:41,173 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:44:41,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:44:41,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:44:41,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:44:41,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:44:41,490 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:44:41,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-27 16:44:41,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687dda9fb/54f888e12b4f421183002f0cd89fd676/FLAG8da784c27 [2019-12-27 16:44:42,081 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:44:42,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-27 16:44:42,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687dda9fb/54f888e12b4f421183002f0cd89fd676/FLAG8da784c27 [2019-12-27 16:44:42,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687dda9fb/54f888e12b4f421183002f0cd89fd676 [2019-12-27 16:44:42,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:44:42,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:44:42,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:44:42,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:44:42,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:44:42,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:44:42" (1/1) ... [2019-12-27 16:44:42,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79cc5cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:42, skipping insertion in model container [2019-12-27 16:44:42,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:44:42" (1/1) ... [2019-12-27 16:44:42,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:44:42,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:44:42,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:44:42,936 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:44:43,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:44:43,075 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:44:43,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43 WrapperNode [2019-12-27 16:44:43,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:44:43,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:44:43,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:44:43,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:44:43,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... [2019-12-27 16:44:43,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... [2019-12-27 16:44:43,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:44:43,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:44:43,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:44:43,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:44:43,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... [2019-12-27 16:44:43,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... [2019-12-27 16:44:43,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... [2019-12-27 16:44:43,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... [2019-12-27 16:44:43,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... [2019-12-27 16:44:43,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... [2019-12-27 16:44:43,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... [2019-12-27 16:44:43,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:44:43,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:44:43,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:44:43,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:44:43,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:44:43,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:44:43,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:44:43,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:44:43,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:44:43,246 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:44:43,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:44:43,247 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:44:43,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:44:43,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:44:43,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:44:43,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:44:43,249 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:44:43,982 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:44:43,983 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:44:43,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:44:43 BoogieIcfgContainer [2019-12-27 16:44:43,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:44:43,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:44:43,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:44:43,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:44:43,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:44:42" (1/3) ... [2019-12-27 16:44:43,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:44:43, skipping insertion in model container [2019-12-27 16:44:43,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:43" (2/3) ... [2019-12-27 16:44:43,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:44:43, skipping insertion in model container [2019-12-27 16:44:43,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:44:43" (3/3) ... [2019-12-27 16:44:43,996 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.oepc.i [2019-12-27 16:44:44,005 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:44:44,006 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:44:44,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:44:44,016 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:44:44,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,058 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,058 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,124 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:44,153 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:44:44,175 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:44:44,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:44:44,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:44:44,176 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:44:44,176 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:44:44,176 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:44:44,176 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:44:44,176 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:44:44,201 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-27 16:44:44,203 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 16:44:44,295 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 16:44:44,295 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:44:44,309 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:44:44,329 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 16:44:44,376 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 16:44:44,376 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:44:44,382 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:44:44,396 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 16:44:44,397 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:44:49,699 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 16:44:49,826 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:44:49,852 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-27 16:44:49,852 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-27 16:44:49,856 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-27 16:44:50,280 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 16:44:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 16:44:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:44:50,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:50,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:44:50,291 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:50,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:50,298 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-27 16:44:50,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:50,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392196332] [2019-12-27 16:44:50,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:50,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392196332] [2019-12-27 16:44:50,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:50,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:44:50,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [25492691] [2019-12-27 16:44:50,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:50,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:50,617 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:44:50,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:50,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:50,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:44:50,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:50,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:44:50,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:50,636 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 16:44:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:50,933 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-27 16:44:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:44:50,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:44:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:51,016 INFO L225 Difference]: With dead ends: 8472 [2019-12-27 16:44:51,017 INFO L226 Difference]: Without dead ends: 7980 [2019-12-27 16:44:51,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-27 16:44:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-27 16:44:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-27 16:44:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-27 16:44:51,446 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-27 16:44:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:51,447 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-27 16:44:51,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:44:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-27 16:44:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:44:51,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:51,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:51,453 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-27 16:44:51,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:51,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615403414] [2019-12-27 16:44:51,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615403414] [2019-12-27 16:44:51,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:51,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:44:51,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734985598] [2019-12-27 16:44:51,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:51,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:51,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:44:51,537 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:51,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:51,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:44:51,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:51,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:44:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:51,539 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 3 states. [2019-12-27 16:44:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:51,563 INFO L93 Difference]: Finished difference Result 1284 states and 2972 transitions. [2019-12-27 16:44:51,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:44:51,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 16:44:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:51,571 INFO L225 Difference]: With dead ends: 1284 [2019-12-27 16:44:51,571 INFO L226 Difference]: Without dead ends: 1284 [2019-12-27 16:44:51,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-12-27 16:44:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-12-27 16:44:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-27 16:44:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2972 transitions. [2019-12-27 16:44:51,604 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2972 transitions. Word has length 11 [2019-12-27 16:44:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:51,605 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2972 transitions. [2019-12-27 16:44:51,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:44:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2972 transitions. [2019-12-27 16:44:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:44:51,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:51,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:51,607 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:51,607 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-27 16:44:51,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:51,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881062146] [2019-12-27 16:44:51,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:51,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881062146] [2019-12-27 16:44:51,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:51,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:51,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [307045674] [2019-12-27 16:44:51,673 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:51,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:51,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:44:51,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:51,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:51,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:44:51,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:44:51,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:51,680 INFO L87 Difference]: Start difference. First operand 1284 states and 2972 transitions. Second operand 3 states. [2019-12-27 16:44:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:51,784 INFO L93 Difference]: Finished difference Result 1993 states and 4593 transitions. [2019-12-27 16:44:51,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:44:51,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 16:44:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:51,864 INFO L225 Difference]: With dead ends: 1993 [2019-12-27 16:44:51,865 INFO L226 Difference]: Without dead ends: 1993 [2019-12-27 16:44:51,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-27 16:44:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1444. [2019-12-27 16:44:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-27 16:44:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3429 transitions. [2019-12-27 16:44:51,918 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3429 transitions. Word has length 14 [2019-12-27 16:44:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:51,919 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3429 transitions. [2019-12-27 16:44:51,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:44:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3429 transitions. [2019-12-27 16:44:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:44:51,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:51,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:51,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:51,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:51,925 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-27 16:44:51,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:51,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401469502] [2019-12-27 16:44:51,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:52,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401469502] [2019-12-27 16:44:52,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:52,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:44:52,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1514529623] [2019-12-27 16:44:52,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:52,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:52,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:44:52,066 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:52,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:52,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:44:52,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:52,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:44:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:52,067 INFO L87 Difference]: Start difference. First operand 1444 states and 3429 transitions. Second operand 4 states. [2019-12-27 16:44:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:52,252 INFO L93 Difference]: Finished difference Result 1803 states and 4159 transitions. [2019-12-27 16:44:52,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:44:52,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:44:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:52,263 INFO L225 Difference]: With dead ends: 1803 [2019-12-27 16:44:52,263 INFO L226 Difference]: Without dead ends: 1803 [2019-12-27 16:44:52,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-27 16:44:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1739. [2019-12-27 16:44:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-27 16:44:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4035 transitions. [2019-12-27 16:44:52,312 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4035 transitions. Word has length 14 [2019-12-27 16:44:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:52,313 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 4035 transitions. [2019-12-27 16:44:52,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4035 transitions. [2019-12-27 16:44:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:44:52,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:52,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:52,314 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-27 16:44:52,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:52,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782620232] [2019-12-27 16:44:52,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:52,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782620232] [2019-12-27 16:44:52,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:52,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:44:52,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1551296193] [2019-12-27 16:44:52,369 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:52,370 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:52,372 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:44:52,373 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:52,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:52,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:44:52,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:52,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:44:52,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:52,374 INFO L87 Difference]: Start difference. First operand 1739 states and 4035 transitions. Second operand 4 states. [2019-12-27 16:44:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:52,549 INFO L93 Difference]: Finished difference Result 2116 states and 4835 transitions. [2019-12-27 16:44:52,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:44:52,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:44:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:52,561 INFO L225 Difference]: With dead ends: 2116 [2019-12-27 16:44:52,561 INFO L226 Difference]: Without dead ends: 2116 [2019-12-27 16:44:52,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-27 16:44:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1856. [2019-12-27 16:44:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-27 16:44:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4299 transitions. [2019-12-27 16:44:52,606 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4299 transitions. Word has length 14 [2019-12-27 16:44:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:52,607 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 4299 transitions. [2019-12-27 16:44:52,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4299 transitions. [2019-12-27 16:44:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:44:52,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:52,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:52,610 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:52,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-27 16:44:52,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:52,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456356031] [2019-12-27 16:44:52,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:52,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456356031] [2019-12-27 16:44:52,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:52,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:52,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [498595082] [2019-12-27 16:44:52,731 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:52,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:52,739 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 16:44:52,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:52,740 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:52,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:52,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:52,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:52,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:52,741 INFO L87 Difference]: Start difference. First operand 1856 states and 4299 transitions. Second operand 5 states. [2019-12-27 16:44:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:53,028 INFO L93 Difference]: Finished difference Result 2383 states and 5349 transitions. [2019-12-27 16:44:53,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:44:53,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:44:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:53,054 INFO L225 Difference]: With dead ends: 2383 [2019-12-27 16:44:53,054 INFO L226 Difference]: Without dead ends: 2383 [2019-12-27 16:44:53,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:44:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-27 16:44:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2127. [2019-12-27 16:44:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-27 16:44:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4855 transitions. [2019-12-27 16:44:53,112 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4855 transitions. Word has length 25 [2019-12-27 16:44:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:53,113 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4855 transitions. [2019-12-27 16:44:53,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4855 transitions. [2019-12-27 16:44:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:44:53,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:53,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:53,116 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1878239565, now seen corresponding path program 1 times [2019-12-27 16:44:53,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:53,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136582709] [2019-12-27 16:44:53,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:53,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136582709] [2019-12-27 16:44:53,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:53,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:44:53,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [607144128] [2019-12-27 16:44:53,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:53,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:53,227 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 16:44:53,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:53,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:53,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:44:53,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:53,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:44:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:53,231 INFO L87 Difference]: Start difference. First operand 2127 states and 4855 transitions. Second operand 3 states. [2019-12-27 16:44:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:53,249 INFO L93 Difference]: Finished difference Result 2126 states and 4853 transitions. [2019-12-27 16:44:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:44:53,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 16:44:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:53,257 INFO L225 Difference]: With dead ends: 2126 [2019-12-27 16:44:53,257 INFO L226 Difference]: Without dead ends: 2126 [2019-12-27 16:44:53,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-27 16:44:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2126. [2019-12-27 16:44:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-27 16:44:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 4853 transitions. [2019-12-27 16:44:53,362 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 4853 transitions. Word has length 26 [2019-12-27 16:44:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:53,363 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 4853 transitions. [2019-12-27 16:44:53,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:44:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 4853 transitions. [2019-12-27 16:44:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:44:53,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:53,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] [2019-12-27 16:44:53,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:53,367 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-27 16:44:53,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:53,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576065317] [2019-12-27 16:44:53,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:53,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576065317] [2019-12-27 16:44:53,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:53,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:53,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [770002126] [2019-12-27 16:44:53,497 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:53,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:53,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:44:53,510 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:53,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:53,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:53,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:53,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:53,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:53,512 INFO L87 Difference]: Start difference. First operand 2126 states and 4853 transitions. Second operand 5 states. [2019-12-27 16:44:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:53,803 INFO L93 Difference]: Finished difference Result 2503 states and 5587 transitions. [2019-12-27 16:44:53,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:44:53,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:44:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:53,810 INFO L225 Difference]: With dead ends: 2503 [2019-12-27 16:44:53,810 INFO L226 Difference]: Without dead ends: 2503 [2019-12-27 16:44:53,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-27 16:44:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-27 16:44:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1976. [2019-12-27 16:44:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-12-27 16:44:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4537 transitions. [2019-12-27 16:44:53,859 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4537 transitions. Word has length 26 [2019-12-27 16:44:53,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:53,862 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 4537 transitions. [2019-12-27 16:44:53,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4537 transitions. [2019-12-27 16:44:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:44:53,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:53,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:53,865 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:53,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1895680429, now seen corresponding path program 1 times [2019-12-27 16:44:53,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:53,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970320146] [2019-12-27 16:44:53,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:53,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970320146] [2019-12-27 16:44:53,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:53,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:53,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612394374] [2019-12-27 16:44:53,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:53,920 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:53,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 16:44:53,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:53,943 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:44:53,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:53,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:53,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:53,944 INFO L87 Difference]: Start difference. First operand 1976 states and 4537 transitions. Second operand 5 states. [2019-12-27 16:44:54,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:54,008 INFO L93 Difference]: Finished difference Result 3151 states and 7355 transitions. [2019-12-27 16:44:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:44:54,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 16:44:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:54,013 INFO L225 Difference]: With dead ends: 3151 [2019-12-27 16:44:54,013 INFO L226 Difference]: Without dead ends: 1451 [2019-12-27 16:44:54,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-12-27 16:44:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1433. [2019-12-27 16:44:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-27 16:44:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3305 transitions. [2019-12-27 16:44:54,043 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3305 transitions. Word has length 27 [2019-12-27 16:44:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:54,044 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3305 transitions. [2019-12-27 16:44:54,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3305 transitions. [2019-12-27 16:44:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:44:54,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:54,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:54,047 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1902769443, now seen corresponding path program 2 times [2019-12-27 16:44:54,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:54,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807371118] [2019-12-27 16:44:54,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:54,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807371118] [2019-12-27 16:44:54,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:54,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:44:54,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [468457466] [2019-12-27 16:44:54,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:54,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:54,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 41 transitions. [2019-12-27 16:44:54,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:54,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:44:54,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:44:54,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:54,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:44:54,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:54,192 INFO L87 Difference]: Start difference. First operand 1433 states and 3305 transitions. Second operand 6 states. [2019-12-27 16:44:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:54,754 INFO L93 Difference]: Finished difference Result 2262 states and 5074 transitions. [2019-12-27 16:44:54,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:44:54,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:44:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:54,762 INFO L225 Difference]: With dead ends: 2262 [2019-12-27 16:44:54,762 INFO L226 Difference]: Without dead ends: 2262 [2019-12-27 16:44:54,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:44:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2019-12-27 16:44:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2061. [2019-12-27 16:44:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-12-27 16:44:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4683 transitions. [2019-12-27 16:44:54,805 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4683 transitions. Word has length 27 [2019-12-27 16:44:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:54,806 INFO L462 AbstractCegarLoop]: Abstraction has 2061 states and 4683 transitions. [2019-12-27 16:44:54,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:44:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4683 transitions. [2019-12-27 16:44:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:44:54,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:54,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] [2019-12-27 16:44:54,810 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash -348234267, now seen corresponding path program 1 times [2019-12-27 16:44:54,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:54,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30951559] [2019-12-27 16:44:54,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:54,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30951559] [2019-12-27 16:44:54,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:54,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:54,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418989393] [2019-12-27 16:44:54,889 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:54,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:54,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 42 transitions. [2019-12-27 16:44:54,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:54,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:54,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:44:54,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:54,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:44:54,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:54,910 INFO L87 Difference]: Start difference. First operand 2061 states and 4683 transitions. Second operand 4 states. [2019-12-27 16:44:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:54,925 INFO L93 Difference]: Finished difference Result 1113 states and 2397 transitions. [2019-12-27 16:44:54,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:44:54,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 16:44:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:54,928 INFO L225 Difference]: With dead ends: 1113 [2019-12-27 16:44:54,928 INFO L226 Difference]: Without dead ends: 1002 [2019-12-27 16:44:54,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-27 16:44:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 960. [2019-12-27 16:44:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-27 16:44:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2144 transitions. [2019-12-27 16:44:54,947 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2144 transitions. Word has length 28 [2019-12-27 16:44:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:54,948 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2144 transitions. [2019-12-27 16:44:54,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2144 transitions. [2019-12-27 16:44:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:44:54,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:54,952 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-27 16:44:54,953 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:54,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash -359202268, now seen corresponding path program 1 times [2019-12-27 16:44:54,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:54,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917096937] [2019-12-27 16:44:54,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:55,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917096937] [2019-12-27 16:44:55,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:55,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:44:55,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682681631] [2019-12-27 16:44:55,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:55,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:55,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 137 transitions. [2019-12-27 16:44:55,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:55,175 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:44:55,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:44:55,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:55,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:44:55,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:44:55,176 INFO L87 Difference]: Start difference. First operand 960 states and 2144 transitions. Second operand 7 states. [2019-12-27 16:44:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:55,488 INFO L93 Difference]: Finished difference Result 2777 states and 5836 transitions. [2019-12-27 16:44:55,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:44:55,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 16:44:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:55,493 INFO L225 Difference]: With dead ends: 2777 [2019-12-27 16:44:55,493 INFO L226 Difference]: Without dead ends: 1853 [2019-12-27 16:44:55,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:44:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-12-27 16:44:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 998. [2019-12-27 16:44:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-12-27 16:44:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2203 transitions. [2019-12-27 16:44:55,520 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2203 transitions. Word has length 51 [2019-12-27 16:44:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:55,520 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 2203 transitions. [2019-12-27 16:44:55,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:44:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2203 transitions. [2019-12-27 16:44:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:44:55,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:55,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:55,523 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:55,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1598138544, now seen corresponding path program 2 times [2019-12-27 16:44:55,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:55,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675386176] [2019-12-27 16:44:55,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:55,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675386176] [2019-12-27 16:44:55,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:55,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:44:55,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781746061] [2019-12-27 16:44:55,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:55,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:55,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 123 transitions. [2019-12-27 16:44:55,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:55,721 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:44:55,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:55,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:55,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:55,722 INFO L87 Difference]: Start difference. First operand 998 states and 2203 transitions. Second operand 5 states. [2019-12-27 16:44:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:55,957 INFO L93 Difference]: Finished difference Result 1135 states and 2453 transitions. [2019-12-27 16:44:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:44:55,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 16:44:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:55,961 INFO L225 Difference]: With dead ends: 1135 [2019-12-27 16:44:55,962 INFO L226 Difference]: Without dead ends: 1135 [2019-12-27 16:44:55,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2019-12-27 16:44:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1047. [2019-12-27 16:44:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-12-27 16:44:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 2300 transitions. [2019-12-27 16:44:56,014 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 2300 transitions. Word has length 51 [2019-12-27 16:44:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:56,015 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 2300 transitions. [2019-12-27 16:44:56,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 2300 transitions. [2019-12-27 16:44:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:44:56,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:56,018 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-27 16:44:56,018 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:56,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:56,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1838514274, now seen corresponding path program 3 times [2019-12-27 16:44:56,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:56,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866086099] [2019-12-27 16:44:56,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:56,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866086099] [2019-12-27 16:44:56,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:56,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:44:56,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304016361] [2019-12-27 16:44:56,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:56,172 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:56,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 93 transitions. [2019-12-27 16:44:56,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:56,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:56,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:44:56,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:56,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:44:56,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:56,214 INFO L87 Difference]: Start difference. First operand 1047 states and 2300 transitions. Second operand 3 states. [2019-12-27 16:44:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:56,227 INFO L93 Difference]: Finished difference Result 1046 states and 2298 transitions. [2019-12-27 16:44:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:44:56,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 16:44:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:56,230 INFO L225 Difference]: With dead ends: 1046 [2019-12-27 16:44:56,230 INFO L226 Difference]: Without dead ends: 1046 [2019-12-27 16:44:56,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-12-27 16:44:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 931. [2019-12-27 16:44:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-27 16:44:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 2087 transitions. [2019-12-27 16:44:56,248 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 2087 transitions. Word has length 51 [2019-12-27 16:44:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:56,248 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 2087 transitions. [2019-12-27 16:44:56,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:44:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 2087 transitions. [2019-12-27 16:44:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:44:56,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:56,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:56,251 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash 505389010, now seen corresponding path program 1 times [2019-12-27 16:44:56,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:56,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714094659] [2019-12-27 16:44:56,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:56,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714094659] [2019-12-27 16:44:56,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:56,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:44:56,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [868751500] [2019-12-27 16:44:56,421 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:56,443 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:56,500 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 124 transitions. [2019-12-27 16:44:56,501 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:56,539 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:44:56,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:44:56,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:56,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:44:56,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:44:56,540 INFO L87 Difference]: Start difference. First operand 931 states and 2087 transitions. Second operand 9 states. [2019-12-27 16:44:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:57,380 INFO L93 Difference]: Finished difference Result 1409 states and 2970 transitions. [2019-12-27 16:44:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:44:57,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 16:44:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:57,384 INFO L225 Difference]: With dead ends: 1409 [2019-12-27 16:44:57,385 INFO L226 Difference]: Without dead ends: 1409 [2019-12-27 16:44:57,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:44:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2019-12-27 16:44:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 736. [2019-12-27 16:44:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 16:44:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1583 transitions. [2019-12-27 16:44:57,401 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1583 transitions. Word has length 52 [2019-12-27 16:44:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:57,401 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1583 transitions. [2019-12-27 16:44:57,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:44:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1583 transitions. [2019-12-27 16:44:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:44:57,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:57,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:57,404 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1643675972, now seen corresponding path program 2 times [2019-12-27 16:44:57,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:57,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274280176] [2019-12-27 16:44:57,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:57,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274280176] [2019-12-27 16:44:57,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:57,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:57,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5983454] [2019-12-27 16:44:57,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:57,537 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:57,575 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 93 transitions. [2019-12-27 16:44:57,575 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:57,579 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:44:57,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:44:57,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:57,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:44:57,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:57,580 INFO L87 Difference]: Start difference. First operand 736 states and 1583 transitions. Second operand 4 states. [2019-12-27 16:44:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:57,641 INFO L93 Difference]: Finished difference Result 900 states and 1911 transitions. [2019-12-27 16:44:57,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:44:57,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 16:44:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:57,643 INFO L225 Difference]: With dead ends: 900 [2019-12-27 16:44:57,643 INFO L226 Difference]: Without dead ends: 900 [2019-12-27 16:44:57,644 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-27 16:44:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-27 16:44:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 750. [2019-12-27 16:44:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-12-27 16:44:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1614 transitions. [2019-12-27 16:44:57,658 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1614 transitions. Word has length 52 [2019-12-27 16:44:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:57,658 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1614 transitions. [2019-12-27 16:44:57,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1614 transitions. [2019-12-27 16:44:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:44:57,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:57,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:57,661 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash -122108504, now seen corresponding path program 1 times [2019-12-27 16:44:57,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:57,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068037190] [2019-12-27 16:44:57,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:57,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068037190] [2019-12-27 16:44:57,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:57,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:44:57,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1364112421] [2019-12-27 16:44:57,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:57,760 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:57,816 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 115 transitions. [2019-12-27 16:44:57,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:57,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:44:57,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:57,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:57,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:57,841 INFO L87 Difference]: Start difference. First operand 750 states and 1614 transitions. Second operand 5 states. [2019-12-27 16:44:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:58,167 INFO L93 Difference]: Finished difference Result 1421 states and 3046 transitions. [2019-12-27 16:44:58,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:44:58,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 16:44:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:58,172 INFO L225 Difference]: With dead ends: 1421 [2019-12-27 16:44:58,172 INFO L226 Difference]: Without dead ends: 1421 [2019-12-27 16:44:58,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:44:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-12-27 16:44:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 830. [2019-12-27 16:44:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-27 16:44:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1816 transitions. [2019-12-27 16:44:58,190 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1816 transitions. Word has length 53 [2019-12-27 16:44:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:58,190 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1816 transitions. [2019-12-27 16:44:58,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1816 transitions. [2019-12-27 16:44:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:44:58,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:58,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:58,193 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1190562228, now seen corresponding path program 1 times [2019-12-27 16:44:58,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:58,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260172439] [2019-12-27 16:44:58,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:58,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260172439] [2019-12-27 16:44:58,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:58,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:44:58,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137849893] [2019-12-27 16:44:58,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:58,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:58,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 115 transitions. [2019-12-27 16:44:58,402 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:58,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:58,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:58,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:58,403 INFO L87 Difference]: Start difference. First operand 830 states and 1816 transitions. Second operand 5 states. [2019-12-27 16:44:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:58,657 INFO L93 Difference]: Finished difference Result 997 states and 2134 transitions. [2019-12-27 16:44:58,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:44:58,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 16:44:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:58,660 INFO L225 Difference]: With dead ends: 997 [2019-12-27 16:44:58,660 INFO L226 Difference]: Without dead ends: 997 [2019-12-27 16:44:58,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-27 16:44:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 883. [2019-12-27 16:44:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-27 16:44:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1913 transitions. [2019-12-27 16:44:58,676 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1913 transitions. Word has length 53 [2019-12-27 16:44:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:58,676 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1913 transitions. [2019-12-27 16:44:58,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1913 transitions. [2019-12-27 16:44:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:44:58,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:58,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:58,679 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash 821991690, now seen corresponding path program 1 times [2019-12-27 16:44:58,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:58,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845528025] [2019-12-27 16:44:58,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:58,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845528025] [2019-12-27 16:44:58,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:58,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:44:58,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [46996370] [2019-12-27 16:44:58,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:58,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:58,827 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 115 transitions. [2019-12-27 16:44:58,828 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:58,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:44:58,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:44:59,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:44:59,032 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:44:59,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:44:59,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:59,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:44:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:44:59,033 INFO L87 Difference]: Start difference. First operand 883 states and 1913 transitions. Second operand 11 states. [2019-12-27 16:45:00,255 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 16:45:01,490 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 16:45:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:03,746 INFO L93 Difference]: Finished difference Result 3569 states and 7301 transitions. [2019-12-27 16:45:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 16:45:03,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 16:45:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:03,751 INFO L225 Difference]: With dead ends: 3569 [2019-12-27 16:45:03,752 INFO L226 Difference]: Without dead ends: 2221 [2019-12-27 16:45:03,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=579, Invalid=2727, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 16:45:03,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-12-27 16:45:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 943. [2019-12-27 16:45:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-12-27 16:45:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2014 transitions. [2019-12-27 16:45:03,779 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2014 transitions. Word has length 53 [2019-12-27 16:45:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:03,779 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 2014 transitions. [2019-12-27 16:45:03,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:45:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2014 transitions. [2019-12-27 16:45:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:45:03,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:03,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:03,782 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:03,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash 813658986, now seen corresponding path program 2 times [2019-12-27 16:45:03,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:03,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516922382] [2019-12-27 16:45:03,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:03,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516922382] [2019-12-27 16:45:03,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:03,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:45:03,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [209757591] [2019-12-27 16:45:03,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:03,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:04,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 106 transitions. [2019-12-27 16:45:04,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:04,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:45:04,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:45:04,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:45:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:45:04,078 INFO L87 Difference]: Start difference. First operand 943 states and 2014 transitions. Second operand 7 states. [2019-12-27 16:45:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:04,382 INFO L93 Difference]: Finished difference Result 1140 states and 2393 transitions. [2019-12-27 16:45:04,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:45:04,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 16:45:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:04,384 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 16:45:04,385 INFO L226 Difference]: Without dead ends: 1140 [2019-12-27 16:45:04,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:45:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-12-27 16:45:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 777. [2019-12-27 16:45:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-27 16:45:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1634 transitions. [2019-12-27 16:45:04,407 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1634 transitions. Word has length 53 [2019-12-27 16:45:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:04,408 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1634 transitions. [2019-12-27 16:45:04,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:45:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1634 transitions. [2019-12-27 16:45:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:45:04,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:04,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:04,413 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-27 16:45:04,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:04,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092125989] [2019-12-27 16:45:04,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:45:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:45:04,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:45:04,583 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:45:04,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= (store .cse0 |v_ULTIMATE.start_main_~#t837~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$w_buff1~0_316) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t837~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t837~0.base_35|) |v_ULTIMATE.start_main_~#t837~0.offset_23| 0))) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= 0 |v_ULTIMATE.start_main_~#t837~0.offset_23|) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t837~0.base_35|)) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t837~0.base_35| 4)) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= 0 v_~a$r_buff0_thd1~0_236) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t837~0.base_35|) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_16|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_27|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ULTIMATE.start_main_~#t837~0.base=|v_ULTIMATE.start_main_~#t837~0.base_35|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_~#t837~0.offset=|v_ULTIMATE.start_main_~#t837~0.offset_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ULTIMATE.start_main_~#t838~0.offset, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t838~0.base, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t837~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t837~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 16:45:04,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff1~0_Out-115851850 ~a$w_buff0~0_In-115851850) (= ~a$w_buff0~0_Out-115851850 1) (= ~a$w_buff1_used~0_Out-115851850 ~a$w_buff0_used~0_In-115851850) (= ~a$w_buff0_used~0_Out-115851850 1) (= (mod ~a$w_buff1_used~0_Out-115851850 256) 0) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-115851850| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-115851850) (= |P0Thread1of1ForFork0_#in~arg.offset_In-115851850| P0Thread1of1ForFork0_~arg.offset_Out-115851850) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-115851850| 1) (= P0Thread1of1ForFork0_~arg.base_Out-115851850 |P0Thread1of1ForFork0_#in~arg.base_In-115851850|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-115851850|, ~a$w_buff0~0=~a$w_buff0~0_In-115851850, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-115851850|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-115851850} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-115851850|, ~a$w_buff1~0=~a$w_buff1~0_Out-115851850, ~a$w_buff0~0=~a$w_buff0~0_Out-115851850, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-115851850, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-115851850|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-115851850, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-115851850, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-115851850, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-115851850|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-115851850} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 16:45:04,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t838~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t838~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t838~0.offset_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10|) |v_ULTIMATE.start_main_~#t838~0.offset_9| 1)) |v_#memory_int_7|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t838~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t838~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t838~0.base] because there is no mapped edge [2019-12-27 16:45:04,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1912170298 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1912170298| ~a$w_buff1_used~0_In-1912170298) .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1912170298| |P1Thread1of1ForFork1_#t~ite24_Out-1912170298|) (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-1912170298 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd2~0_In-1912170298 256)) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1912170298 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1912170298 256))))) (and (= |P1Thread1of1ForFork1_#t~ite23_In-1912170298| |P1Thread1of1ForFork1_#t~ite23_Out-1912170298|) (not .cse0) (= ~a$w_buff1_used~0_In-1912170298 |P1Thread1of1ForFork1_#t~ite24_Out-1912170298|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1912170298, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1912170298, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1912170298|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1912170298, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1912170298, ~weak$$choice2~0=~weak$$choice2~0_In-1912170298} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1912170298, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1912170298|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1912170298, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1912170298|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1912170298, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1912170298, ~weak$$choice2~0=~weak$$choice2~0_In-1912170298} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 16:45:04,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_12|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 16:45:04,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-97468596 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-97468596 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-97468596| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-97468596 |P0Thread1of1ForFork0_#t~ite5_Out-97468596|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-97468596, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-97468596} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-97468596|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-97468596, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-97468596} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:45:04,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-116536008 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-116536008 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-116536008 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-116536008 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-116536008| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-116536008 |P0Thread1of1ForFork0_#t~ite6_Out-116536008|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-116536008, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-116536008, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-116536008, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-116536008} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-116536008|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-116536008, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-116536008, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-116536008, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-116536008} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:45:04,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1464029276 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1464029276 256)))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1464029276 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1464029276 ~a$r_buff0_thd1~0_Out-1464029276)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1464029276, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1464029276} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1464029276|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1464029276, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1464029276} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:45:04,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1514570807 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In1514570807 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1514570807 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1514570807 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1514570807|)) (and (= ~a$r_buff1_thd1~0_In1514570807 |P0Thread1of1ForFork0_#t~ite8_Out1514570807|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1514570807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1514570807, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1514570807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1514570807} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1514570807, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1514570807|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1514570807, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1514570807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1514570807} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:45:04,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:45:04,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_13|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:45:04,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In284466545 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out284466545| |P1Thread1of1ForFork1_#t~ite32_Out284466545|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In284466545 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out284466545| ~a~0_In284466545)) (and (not .cse1) .cse2 (= ~a$w_buff1~0_In284466545 |P1Thread1of1ForFork1_#t~ite32_Out284466545|) (not .cse0)))) InVars {~a~0=~a~0_In284466545, ~a$w_buff1~0=~a$w_buff1~0_In284466545, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In284466545, ~a$w_buff1_used~0=~a$w_buff1_used~0_In284466545} OutVars{~a~0=~a~0_In284466545, ~a$w_buff1~0=~a$w_buff1~0_In284466545, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In284466545, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out284466545|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out284466545|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In284466545} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:45:04,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2134062698 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-2134062698 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2134062698|)) (and (= ~a$w_buff0_used~0_In-2134062698 |P1Thread1of1ForFork1_#t~ite34_Out-2134062698|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2134062698, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2134062698} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2134062698|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2134062698, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2134062698} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:45:04,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1639119158 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1639119158 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1639119158 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1639119158 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1639119158|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite35_Out-1639119158| ~a$w_buff1_used~0_In-1639119158) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1639119158, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1639119158, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1639119158, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1639119158} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1639119158, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1639119158, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1639119158, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1639119158|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1639119158} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:45:04,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-706322976 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-706322976 256)))) (or (and (= ~a$r_buff0_thd2~0_In-706322976 |P1Thread1of1ForFork1_#t~ite36_Out-706322976|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-706322976|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-706322976, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-706322976} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-706322976, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-706322976, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-706322976|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:45:04,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-1998550660 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1998550660 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1998550660 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1998550660 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1998550660| ~a$r_buff1_thd2~0_In-1998550660) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1998550660| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1998550660, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1998550660, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1998550660, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1998550660} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1998550660, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1998550660, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1998550660, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1998550660, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1998550660|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:45:04,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~a$r_buff1_thd2~0_110) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:45:04,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:45:04,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1659990637 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1659990637 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-1659990637 |ULTIMATE.start_main_#t~ite40_Out-1659990637|)) (and (= ~a~0_In-1659990637 |ULTIMATE.start_main_#t~ite40_Out-1659990637|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1659990637, ~a$w_buff1~0=~a$w_buff1~0_In-1659990637, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1659990637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1659990637} OutVars{~a~0=~a~0_In-1659990637, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1659990637|, ~a$w_buff1~0=~a$w_buff1~0_In-1659990637, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1659990637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1659990637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:45:04,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:45:04,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2110659221 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-2110659221 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-2110659221| ~a$w_buff0_used~0_In-2110659221)) (and (= |ULTIMATE.start_main_#t~ite42_Out-2110659221| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2110659221, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2110659221} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2110659221, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2110659221, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2110659221|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:45:04,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-394533969 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-394533969 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-394533969 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-394533969 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-394533969 |ULTIMATE.start_main_#t~ite43_Out-394533969|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-394533969|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-394533969, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-394533969, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-394533969, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-394533969} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-394533969, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-394533969, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-394533969, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-394533969, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-394533969|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:45:04,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-259541582 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-259541582 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-259541582|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-259541582 |ULTIMATE.start_main_#t~ite44_Out-259541582|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-259541582, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-259541582} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-259541582, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-259541582, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-259541582|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:45:04,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1167839422 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1167839422 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-1167839422 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1167839422 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1167839422| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1167839422| ~a$r_buff1_thd0~0_In-1167839422) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1167839422, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1167839422, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1167839422, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1167839422} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1167839422, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1167839422, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1167839422, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1167839422, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1167839422|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:45:04,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:45:04,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:45:04 BasicIcfg [2019-12-27 16:45:04,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:45:04,726 INFO L168 Benchmark]: Toolchain (without parser) took 22370.95 ms. Allocated memory was 137.9 MB in the beginning and 590.3 MB in the end (delta: 452.5 MB). Free memory was 99.9 MB in the beginning and 343.0 MB in the end (delta: -243.2 MB). Peak memory consumption was 209.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:04,726 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 16:45:04,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.66 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.4 MB in the beginning and 155.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:04,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.96 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 152.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:04,733 INFO L168 Benchmark]: Boogie Preprocessor took 37.35 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:04,734 INFO L168 Benchmark]: RCFGBuilder took 805.85 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 105.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:04,734 INFO L168 Benchmark]: TraceAbstraction took 20734.17 ms. Allocated memory was 202.4 MB in the beginning and 590.3 MB in the end (delta: 388.0 MB). Free memory was 105.4 MB in the beginning and 343.0 MB in the end (delta: -237.6 MB). Peak memory consumption was 150.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:04,737 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 723.66 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.4 MB in the beginning and 155.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.96 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 152.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.35 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 805.85 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 105.4 MB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20734.17 ms. Allocated memory was 202.4 MB in the beginning and 590.3 MB in the end (delta: 388.0 MB). Free memory was 105.4 MB in the beginning and 343.0 MB in the end (delta: -237.6 MB). Peak memory consumption was 150.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.4s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2548 SDtfs, 2986 SDslu, 5126 SDs, 0 SdLazy, 4136 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 47 SyntacticMatches, 32 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 6144 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 115225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...