/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:11:56,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:11:56,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:11:56,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:11:56,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:11:56,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:11:56,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:11:56,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:11:56,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:11:56,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:11:56,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:11:56,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:11:56,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:11:56,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:11:56,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:11:56,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:11:56,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:11:56,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:11:56,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:11:56,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:11:56,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:11:56,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:11:56,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:11:56,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:11:56,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:11:56,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:11:56,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:11:56,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:11:56,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:11:56,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:11:56,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:11:56,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:11:56,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:11:56,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:11:56,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:11:56,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:11:56,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:11:56,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:11:56,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:11:56,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:11:56,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:11:56,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:11:56,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:11:56,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:11:56,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:11:56,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:11:56,153 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:11:56,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:11:56,156 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:11:56,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:11:56,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:11:56,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:11:56,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:11:56,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:11:56,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:11:56,157 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:11:56,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:11:56,158 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:11:56,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:11:56,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:11:56,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:11:56,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:11:56,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:11:56,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:11:56,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:11:56,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:11:56,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:11:56,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:11:56,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:11:56,163 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:11:56,163 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:11:56,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:11:56,163 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:11:56,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:11:56,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:11:56,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:11:56,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:11:56,516 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:11:56,517 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:11:56,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc.i [2019-12-27 21:11:56,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb016d79/94c8713f82714295a302c626781e4433/FLAG0520c97ae [2019-12-27 21:11:57,087 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:11:57,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc.i [2019-12-27 21:11:57,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb016d79/94c8713f82714295a302c626781e4433/FLAG0520c97ae [2019-12-27 21:11:57,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb016d79/94c8713f82714295a302c626781e4433 [2019-12-27 21:11:57,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:11:57,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:11:57,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:11:57,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:11:57,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:11:57,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:11:57" (1/1) ... [2019-12-27 21:11:57,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677b895b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:57, skipping insertion in model container [2019-12-27 21:11:57,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:11:57" (1/1) ... [2019-12-27 21:11:57,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:11:57,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:11:58,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:11:58,116 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:11:58,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:11:58,283 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:11:58,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58 WrapperNode [2019-12-27 21:11:58,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:11:58,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:11:58,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:11:58,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:11:58,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (1/1) ... [2019-12-27 21:11:58,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (1/1) ... [2019-12-27 21:11:58,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:11:58,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:11:58,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:11:58,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:11:58,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (1/1) ... [2019-12-27 21:11:58,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (1/1) ... [2019-12-27 21:11:58,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (1/1) ... [2019-12-27 21:11:58,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (1/1) ... [2019-12-27 21:11:58,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (1/1) ... [2019-12-27 21:11:58,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (1/1) ... [2019-12-27 21:11:58,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (1/1) ... [2019-12-27 21:11:58,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:11:58,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:11:58,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:11:58,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:11:58,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (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 21:11:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:11:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:11:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:11:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:11:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:11:58,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:11:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:11:58,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:11:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:11:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:11:58,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:11:58,456 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 21:11:59,183 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:11:59,184 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:11:59,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:11:59 BoogieIcfgContainer [2019-12-27 21:11:59,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:11:59,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:11:59,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:11:59,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:11:59,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:11:57" (1/3) ... [2019-12-27 21:11:59,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f756afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:11:59, skipping insertion in model container [2019-12-27 21:11:59,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:58" (2/3) ... [2019-12-27 21:11:59,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f756afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:11:59, skipping insertion in model container [2019-12-27 21:11:59,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:11:59" (3/3) ... [2019-12-27 21:11:59,199 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc.i [2019-12-27 21:11:59,212 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:11:59,213 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:11:59,223 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:11:59,224 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:11:59,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,265 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,323 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,331 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:59,347 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:11:59,368 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:11:59,368 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:11:59,368 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:11:59,368 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:11:59,368 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:11:59,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:11:59,369 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:11:59,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:11:59,386 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 21:11:59,388 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:11:59,482 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:11:59,483 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:11:59,497 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:11:59,516 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:11:59,563 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:11:59,563 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:11:59,568 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:11:59,582 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:11:59,584 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:12:02,800 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:12:02,916 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:12:02,945 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49804 [2019-12-27 21:12:02,945 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 21:12:02,948 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 21:12:03,383 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-27 21:12:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-27 21:12:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:12:03,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:03,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:12:03,394 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash 792295, now seen corresponding path program 1 times [2019-12-27 21:12:03,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:03,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165537252] [2019-12-27 21:12:03,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:03,678 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 21:12:03,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165537252] [2019-12-27 21:12:03,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:03,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:12:03,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1118815285] [2019-12-27 21:12:03,682 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:03,686 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:03,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:12:03,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:03,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:03,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:03,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:03,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:03,730 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-27 21:12:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:04,047 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-27 21:12:04,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:04,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:12:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:04,142 INFO L225 Difference]: With dead ends: 7932 [2019-12-27 21:12:04,143 INFO L226 Difference]: Without dead ends: 7440 [2019-12-27 21:12:04,144 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 21:12:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-27 21:12:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-27 21:12:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-27 21:12:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-27 21:12:04,631 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-27 21:12:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:04,631 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-27 21:12:04,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-27 21:12:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:12:04,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:04,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:04,635 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:04,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:04,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1331077168, now seen corresponding path program 1 times [2019-12-27 21:12:04,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:04,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085936162] [2019-12-27 21:12:04,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:04,708 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 21:12:04,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085936162] [2019-12-27 21:12:04,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:04,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:04,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [127905622] [2019-12-27 21:12:04,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:04,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:04,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:12:04,713 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:04,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:04,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:04,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:04,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:04,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:04,716 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-27 21:12:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:04,753 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-27 21:12:04,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:04,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:12:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:04,761 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 21:12:04,761 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 21:12:04,762 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 21:12:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 21:12:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 21:12:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 21:12:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-27 21:12:04,802 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-27 21:12:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:04,802 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-27 21:12:04,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-27 21:12:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:12:04,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:04,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:04,808 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash 265392593, now seen corresponding path program 1 times [2019-12-27 21:12:04,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:04,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652350129] [2019-12-27 21:12:04,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:04,870 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 21:12:04,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652350129] [2019-12-27 21:12:04,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:04,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:04,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [197233816] [2019-12-27 21:12:04,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:04,874 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:04,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:12:04,881 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:04,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:04,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:04,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:04,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:04,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:04,885 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-27 21:12:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:04,965 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-27 21:12:04,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:04,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 21:12:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:04,976 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 21:12:04,976 INFO L226 Difference]: Without dead ends: 1956 [2019-12-27 21:12:04,977 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 21:12:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-27 21:12:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-27 21:12:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-27 21:12:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-27 21:12:05,022 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-27 21:12:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:05,022 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-27 21:12:05,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-27 21:12:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:12:05,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:05,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:05,024 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash 175245027, now seen corresponding path program 1 times [2019-12-27 21:12:05,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:05,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850158058] [2019-12-27 21:12:05,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:05,083 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 21:12:05,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850158058] [2019-12-27 21:12:05,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:05,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:05,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877600411] [2019-12-27 21:12:05,085 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:05,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:05,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:12:05,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:05,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:05,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:05,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:05,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:05,090 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-27 21:12:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:05,255 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-27 21:12:05,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:12:05,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:12:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:05,264 INFO L225 Difference]: With dead ends: 1678 [2019-12-27 21:12:05,265 INFO L226 Difference]: Without dead ends: 1678 [2019-12-27 21:12:05,265 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 21:12:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-27 21:12:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-27 21:12:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-27 21:12:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-27 21:12:05,311 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-27 21:12:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:05,312 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-27 21:12:05,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-27 21:12:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:12:05,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:05,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:05,313 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:05,314 INFO L82 PathProgramCache]: Analyzing trace with hash 941909210, now seen corresponding path program 1 times [2019-12-27 21:12:05,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:05,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475492444] [2019-12-27 21:12:05,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:05,383 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 21:12:05,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475492444] [2019-12-27 21:12:05,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:05,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:05,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994640418] [2019-12-27 21:12:05,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:05,387 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:05,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:12:05,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:05,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:05,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:05,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:05,391 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-27 21:12:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:05,545 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-27 21:12:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:12:05,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:12:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:05,556 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 21:12:05,557 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 21:12:05,557 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 21:12:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 21:12:05,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-27 21:12:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-27 21:12:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-27 21:12:05,666 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-27 21:12:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:05,666 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-27 21:12:05,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-27 21:12:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:12:05,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:05,669 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 21:12:05,669 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:05,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1601113905, now seen corresponding path program 1 times [2019-12-27 21:12:05,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:05,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790063436] [2019-12-27 21:12:05,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:05,742 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 21:12:05,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790063436] [2019-12-27 21:12:05,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:05,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:05,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [583548349] [2019-12-27 21:12:05,744 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:05,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:05,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:12:05,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:05,755 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:05,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:05,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:05,756 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-27 21:12:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:05,991 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-27 21:12:05,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:05,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:12:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:06,004 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 21:12:06,004 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 21:12:06,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:12:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 21:12:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-27 21:12:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-27 21:12:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-27 21:12:06,050 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-27 21:12:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:06,050 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-27 21:12:06,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-27 21:12:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:12:06,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:06,053 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 21:12:06,054 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:06,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash 16465726, now seen corresponding path program 1 times [2019-12-27 21:12:06,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:06,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317403525] [2019-12-27 21:12:06,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:06,098 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 21:12:06,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317403525] [2019-12-27 21:12:06,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:06,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:06,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [941683139] [2019-12-27 21:12:06,099 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:06,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:06,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:12:06,115 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:06,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:06,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:06,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:06,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:06,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:06,116 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-27 21:12:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:06,157 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-27 21:12:06,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:06,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 21:12:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:06,180 INFO L225 Difference]: With dead ends: 2574 [2019-12-27 21:12:06,180 INFO L226 Difference]: Without dead ends: 2574 [2019-12-27 21:12:06,181 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 21:12:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-27 21:12:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-27 21:12:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 21:12:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-27 21:12:06,230 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-27 21:12:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:06,230 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-27 21:12:06,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-27 21:12:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:12:06,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:06,233 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 21:12:06,233 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:06,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:06,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1111732337, now seen corresponding path program 1 times [2019-12-27 21:12:06,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:06,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838750356] [2019-12-27 21:12:06,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:06,315 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 21:12:06,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838750356] [2019-12-27 21:12:06,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:06,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:06,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389255495] [2019-12-27 21:12:06,317 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:06,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:06,329 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 21:12:06,329 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:06,362 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:12:06,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:06,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:06,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:06,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:06,363 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 4 states. [2019-12-27 21:12:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:06,394 INFO L93 Difference]: Finished difference Result 3059 states and 6636 transitions. [2019-12-27 21:12:06,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:06,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 21:12:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:06,400 INFO L225 Difference]: With dead ends: 3059 [2019-12-27 21:12:06,401 INFO L226 Difference]: Without dead ends: 1405 [2019-12-27 21:12:06,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:12:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-27 21:12:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1385. [2019-12-27 21:12:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-12-27 21:12:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2946 transitions. [2019-12-27 21:12:06,431 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2946 transitions. Word has length 26 [2019-12-27 21:12:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:06,431 INFO L462 AbstractCegarLoop]: Abstraction has 1385 states and 2946 transitions. [2019-12-27 21:12:06,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2946 transitions. [2019-12-27 21:12:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:12:06,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:06,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:06,434 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:06,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:06,434 INFO L82 PathProgramCache]: Analyzing trace with hash 858483252, now seen corresponding path program 1 times [2019-12-27 21:12:06,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:06,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002351431] [2019-12-27 21:12:06,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:06,603 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 21:12:06,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002351431] [2019-12-27 21:12:06,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:06,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:06,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [497737169] [2019-12-27 21:12:06,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:06,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:06,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 21:12:06,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:06,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:06,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:06,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:06,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:06,624 INFO L87 Difference]: Start difference. First operand 1385 states and 2946 transitions. Second operand 5 states. [2019-12-27 21:12:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:06,770 INFO L93 Difference]: Finished difference Result 1390 states and 2937 transitions. [2019-12-27 21:12:06,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:06,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 21:12:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:06,776 INFO L225 Difference]: With dead ends: 1390 [2019-12-27 21:12:06,776 INFO L226 Difference]: Without dead ends: 1390 [2019-12-27 21:12:06,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:12:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-12-27 21:12:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1347. [2019-12-27 21:12:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-12-27 21:12:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2871 transitions. [2019-12-27 21:12:06,804 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2871 transitions. Word has length 26 [2019-12-27 21:12:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:06,805 INFO L462 AbstractCegarLoop]: Abstraction has 1347 states and 2871 transitions. [2019-12-27 21:12:06,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2871 transitions. [2019-12-27 21:12:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:12:06,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:06,808 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 21:12:06,809 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:06,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1256798795, now seen corresponding path program 1 times [2019-12-27 21:12:06,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:06,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108224215] [2019-12-27 21:12:06,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:06,885 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 21:12:06,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108224215] [2019-12-27 21:12:06,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:06,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:12:06,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991046581] [2019-12-27 21:12:06,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:06,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:06,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 21:12:06,902 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:06,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:12:06,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:12:06,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:06,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:12:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:12:06,992 INFO L87 Difference]: Start difference. First operand 1347 states and 2871 transitions. Second operand 8 states. [2019-12-27 21:12:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:07,719 INFO L93 Difference]: Finished difference Result 2150 states and 4509 transitions. [2019-12-27 21:12:07,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:12:07,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 21:12:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:07,725 INFO L225 Difference]: With dead ends: 2150 [2019-12-27 21:12:07,726 INFO L226 Difference]: Without dead ends: 2150 [2019-12-27 21:12:07,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-12-27 21:12:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1941. [2019-12-27 21:12:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-12-27 21:12:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 4107 transitions. [2019-12-27 21:12:07,765 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 4107 transitions. Word has length 27 [2019-12-27 21:12:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:07,765 INFO L462 AbstractCegarLoop]: Abstraction has 1941 states and 4107 transitions. [2019-12-27 21:12:07,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:12:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 4107 transitions. [2019-12-27 21:12:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:12:07,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:07,769 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 21:12:07,769 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:07,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash -374854062, now seen corresponding path program 1 times [2019-12-27 21:12:07,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:07,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563238578] [2019-12-27 21:12:07,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:07,816 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 21:12:07,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563238578] [2019-12-27 21:12:07,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:07,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:07,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965986420] [2019-12-27 21:12:07,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:07,821 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:07,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 21:12:07,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:07,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:12:07,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:07,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:07,852 INFO L87 Difference]: Start difference. First operand 1941 states and 4107 transitions. Second operand 5 states. [2019-12-27 21:12:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:07,871 INFO L93 Difference]: Finished difference Result 1087 states and 2170 transitions. [2019-12-27 21:12:07,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:12:07,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 21:12:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:07,874 INFO L225 Difference]: With dead ends: 1087 [2019-12-27 21:12:07,874 INFO L226 Difference]: Without dead ends: 981 [2019-12-27 21:12:07,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-12-27 21:12:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 909. [2019-12-27 21:12:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 21:12:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1885 transitions. [2019-12-27 21:12:07,892 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1885 transitions. Word has length 28 [2019-12-27 21:12:07,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:07,892 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1885 transitions. [2019-12-27 21:12:07,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1885 transitions. [2019-12-27 21:12:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:07,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:07,894 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 21:12:07,895 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1671814948, now seen corresponding path program 1 times [2019-12-27 21:12:07,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:07,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499984101] [2019-12-27 21:12:07,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:08,058 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 21:12:08,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499984101] [2019-12-27 21:12:08,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:08,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:12:08,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68698573] [2019-12-27 21:12:08,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:08,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:08,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 21:12:08,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:08,186 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:12:08,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:12:08,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:08,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:12:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:08,188 INFO L87 Difference]: Start difference. First operand 909 states and 1885 transitions. Second operand 9 states. [2019-12-27 21:12:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:08,517 INFO L93 Difference]: Finished difference Result 1569 states and 3170 transitions. [2019-12-27 21:12:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:12:08,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 21:12:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:08,523 INFO L225 Difference]: With dead ends: 1569 [2019-12-27 21:12:08,524 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 21:12:08,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:12:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 21:12:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 907. [2019-12-27 21:12:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-12-27 21:12:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1857 transitions. [2019-12-27 21:12:08,544 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1857 transitions. Word has length 51 [2019-12-27 21:12:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:08,545 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1857 transitions. [2019-12-27 21:12:08,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:12:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1857 transitions. [2019-12-27 21:12:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:08,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:08,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:08,549 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:08,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1673779650, now seen corresponding path program 2 times [2019-12-27 21:12:08,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:08,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927459707] [2019-12-27 21:12:08,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:08,704 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 21:12:08,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927459707] [2019-12-27 21:12:08,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:08,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:12:08,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1088608130] [2019-12-27 21:12:08,705 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:08,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:08,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 191 transitions. [2019-12-27 21:12:08,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:09,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:12:09,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:12:09,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:09,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:12:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:12:09,009 INFO L87 Difference]: Start difference. First operand 907 states and 1857 transitions. Second operand 7 states. [2019-12-27 21:12:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:09,569 INFO L93 Difference]: Finished difference Result 1063 states and 2153 transitions. [2019-12-27 21:12:09,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:09,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 21:12:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:09,573 INFO L225 Difference]: With dead ends: 1063 [2019-12-27 21:12:09,574 INFO L226 Difference]: Without dead ends: 1063 [2019-12-27 21:12:09,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2019-12-27 21:12:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 937. [2019-12-27 21:12:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-27 21:12:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1912 transitions. [2019-12-27 21:12:09,592 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1912 transitions. Word has length 51 [2019-12-27 21:12:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:09,592 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 1912 transitions. [2019-12-27 21:12:09,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:12:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1912 transitions. [2019-12-27 21:12:09,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:09,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:09,595 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 21:12:09,595 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash -251445194, now seen corresponding path program 3 times [2019-12-27 21:12:09,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:09,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402786014] [2019-12-27 21:12:09,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:09,661 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 21:12:09,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402786014] [2019-12-27 21:12:09,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:09,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:09,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1954575367] [2019-12-27 21:12:09,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:09,674 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:09,722 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 129 transitions. [2019-12-27 21:12:09,722 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:09,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:12:09,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:09,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:09,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:09,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:09,725 INFO L87 Difference]: Start difference. First operand 937 states and 1912 transitions. Second operand 3 states. [2019-12-27 21:12:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:09,778 INFO L93 Difference]: Finished difference Result 1175 states and 2397 transitions. [2019-12-27 21:12:09,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:09,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 21:12:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:09,782 INFO L225 Difference]: With dead ends: 1175 [2019-12-27 21:12:09,782 INFO L226 Difference]: Without dead ends: 1175 [2019-12-27 21:12:09,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 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 21:12:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-12-27 21:12:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 931. [2019-12-27 21:12:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-27 21:12:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1919 transitions. [2019-12-27 21:12:09,803 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1919 transitions. Word has length 51 [2019-12-27 21:12:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:09,804 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1919 transitions. [2019-12-27 21:12:09,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1919 transitions. [2019-12-27 21:12:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:09,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:09,807 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 21:12:09,807 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:09,807 INFO L82 PathProgramCache]: Analyzing trace with hash 187010410, now seen corresponding path program 1 times [2019-12-27 21:12:09,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:09,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132622432] [2019-12-27 21:12:09,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:09,969 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 21:12:09,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132622432] [2019-12-27 21:12:09,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:09,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:12:09,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [442114479] [2019-12-27 21:12:09,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:09,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:10,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 194 transitions. [2019-12-27 21:12:10,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:10,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:12:10,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:12:10,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:10,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:12:10,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:12:10,585 INFO L87 Difference]: Start difference. First operand 931 states and 1919 transitions. Second operand 8 states. [2019-12-27 21:12:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:11,285 INFO L93 Difference]: Finished difference Result 1141 states and 2310 transitions. [2019-12-27 21:12:11,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:12:11,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 21:12:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:11,289 INFO L225 Difference]: With dead ends: 1141 [2019-12-27 21:12:11,290 INFO L226 Difference]: Without dead ends: 1141 [2019-12-27 21:12:11,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:12:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-12-27 21:12:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1039. [2019-12-27 21:12:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-27 21:12:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 2123 transitions. [2019-12-27 21:12:11,311 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 2123 transitions. Word has length 52 [2019-12-27 21:12:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:11,311 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 2123 transitions. [2019-12-27 21:12:11,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:12:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2123 transitions. [2019-12-27 21:12:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:11,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:11,314 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 21:12:11,314 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:11,314 INFO L82 PathProgramCache]: Analyzing trace with hash 419680803, now seen corresponding path program 1 times [2019-12-27 21:12:11,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:11,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083097874] [2019-12-27 21:12:11,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:11,421 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 21:12:11,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083097874] [2019-12-27 21:12:11,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:11,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:12:11,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157243482] [2019-12-27 21:12:11,425 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:11,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:11,509 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 152 transitions. [2019-12-27 21:12:11,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:11,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:12:11,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:12:11,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:11,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:12:11,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:12:11,569 INFO L87 Difference]: Start difference. First operand 1039 states and 2123 transitions. Second operand 7 states. [2019-12-27 21:12:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:12,230 INFO L93 Difference]: Finished difference Result 1291 states and 2597 transitions. [2019-12-27 21:12:12,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:12,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 21:12:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:12,236 INFO L225 Difference]: With dead ends: 1291 [2019-12-27 21:12:12,237 INFO L226 Difference]: Without dead ends: 1291 [2019-12-27 21:12:12,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-12-27 21:12:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1075. [2019-12-27 21:12:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-27 21:12:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2189 transitions. [2019-12-27 21:12:12,258 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2189 transitions. Word has length 52 [2019-12-27 21:12:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:12,258 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2189 transitions. [2019-12-27 21:12:12,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:12:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2189 transitions. [2019-12-27 21:12:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:12,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:12,261 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 21:12:12,261 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1329705586, now seen corresponding path program 2 times [2019-12-27 21:12:12,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:12,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080552797] [2019-12-27 21:12:12,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:12,332 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 21:12:12,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080552797] [2019-12-27 21:12:12,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:12,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:12,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004933275] [2019-12-27 21:12:12,333 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:12,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:12,400 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 132 transitions. [2019-12-27 21:12:12,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:12,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:12,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:12,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:12,402 INFO L87 Difference]: Start difference. First operand 1075 states and 2189 transitions. Second operand 3 states. [2019-12-27 21:12:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:12,422 INFO L93 Difference]: Finished difference Result 1075 states and 2188 transitions. [2019-12-27 21:12:12,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:12,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:12:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:12,425 INFO L225 Difference]: With dead ends: 1075 [2019-12-27 21:12:12,425 INFO L226 Difference]: Without dead ends: 1075 [2019-12-27 21:12:12,426 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 21:12:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2019-12-27 21:12:12,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 826. [2019-12-27 21:12:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-27 21:12:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1719 transitions. [2019-12-27 21:12:12,445 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1719 transitions. Word has length 52 [2019-12-27 21:12:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:12,446 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1719 transitions. [2019-12-27 21:12:12,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1719 transitions. [2019-12-27 21:12:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:12:12,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:12,448 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 21:12:12,448 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash 821444371, now seen corresponding path program 1 times [2019-12-27 21:12:12,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:12,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828112312] [2019-12-27 21:12:12,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:12:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:12:12,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:12:12,617 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:12:12,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1089~0.base_22| 4)) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~z$w_buff0_used~0_101 0) (= v_~z~0_24 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= 0 v_~z$r_buff1_thd2~0_49) (= (store .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_22| 1) |v_#valid_47|) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~y~0_7) (= 0 v_~z$w_buff0~0_24) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_9) (= 0 v_~z$r_buff1_thd1~0_20) (< 0 |v_#StackHeapBarrier_14|) (= v_~x~0_18 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1089~0.base_22|) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_22|)) (= |v_ULTIMATE.start_main_~#t1089~0.offset_17| 0) (= 0 v_~z$r_buff1_thd0~0_27) (= v_~z$r_buff0_thd2~0_78 0) (= 0 v_~z$w_buff1_used~0_65) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1089~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1089~0.base_22|) |v_ULTIMATE.start_main_~#t1089~0.offset_17| 0))) (= v_~z$r_buff0_thd1~0_28 0) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_49, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_23, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_21|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t1089~0.offset=|v_ULTIMATE.start_main_~#t1089~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_27, #length=|v_#length_19|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_~#t1089~0.base=|v_ULTIMATE.start_main_~#t1089~0.base_22|, ULTIMATE.start_main_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1090~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1089~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1089~0.base, ULTIMATE.start_main_~#t1090~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 21:12:12,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1090~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11|) |v_ULTIMATE.start_main_~#t1090~0.offset_10| 1))) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1090~0.offset_10|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1090~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1090~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1090~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1090~0.base] because there is no mapped edge [2019-12-27 21:12:12,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= ~z$r_buff0_thd0~0_In2067737215 ~z$r_buff1_thd0~0_Out2067737215) (= ~z$r_buff0_thd1~0_In2067737215 ~z$r_buff1_thd1~0_Out2067737215) (= ~z$r_buff1_thd2~0_Out2067737215 ~z$r_buff0_thd2~0_In2067737215) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2067737215)) (= 1 ~x~0_Out2067737215) (= 1 ~z$r_buff0_thd1~0_Out2067737215)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2067737215, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2067737215, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2067737215, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2067737215} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2067737215, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2067737215, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out2067737215, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out2067737215, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2067737215, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2067737215, ~x~0=~x~0_Out2067737215, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2067737215} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 21:12:12,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1997258925 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1997258925 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1997258925|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1997258925 |P0Thread1of1ForFork0_#t~ite5_Out-1997258925|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997258925, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1997258925} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1997258925|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997258925, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1997258925} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:12:12,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In956059601 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In956059601 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In956059601 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In956059601 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out956059601| ~z$w_buff1_used~0_In956059601)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out956059601| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In956059601, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In956059601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In956059601, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In956059601} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out956059601|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In956059601, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In956059601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In956059601, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In956059601} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:12:12,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-442906773 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-442906773 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-442906773 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-442906773 ~z$r_buff0_thd1~0_In-442906773)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-442906773, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-442906773} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-442906773, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-442906773|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-442906773} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:12:12,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-508082330 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-508082330 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-508082330 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-508082330 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-508082330| ~z$r_buff1_thd1~0_In-508082330) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-508082330| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-508082330, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-508082330, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-508082330, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-508082330} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-508082330, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-508082330|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-508082330, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-508082330, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-508082330} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:12:12,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_16)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:12:12,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd2~0_53 v_~z$r_buff0_thd2~0_52)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_53} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 21:12:12,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L773-->L773-8: Formula: (let ((.cse4 (= 0 (mod ~z$w_buff1_used~0_In1021671357 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1021671357 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In1021671357 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite30_Out1021671357| |P1Thread1of1ForFork1_#t~ite29_Out1021671357|)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In1021671357 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1021671357 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In1021671357| |P1Thread1of1ForFork1_#t~ite28_Out1021671357|) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out1021671357| |P1Thread1of1ForFork1_#t~ite29_In1021671357|) (= |P1Thread1of1ForFork1_#t~ite30_Out1021671357| ~z$r_buff1_thd2~0_In1021671357) (not .cse0)) (and (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse0 (= ~z$r_buff1_thd2~0_In1021671357 |P1Thread1of1ForFork1_#t~ite29_Out1021671357|) .cse5))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite28_Out1021671357| 0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1021671357| |P1Thread1of1ForFork1_#t~ite29_Out1021671357|) .cse0 .cse5 (or .cse6 (not .cse3)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1021671357|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1021671357, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1021671357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1021671357, ~weak$$choice2~0=~weak$$choice2~0_In1021671357, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1021671357, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1021671357|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1021671357|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1021671357|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1021671357, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1021671357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1021671357, ~weak$$choice2~0=~weak$$choice2~0_In1021671357, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1021671357, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1021671357|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:12:12,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:12:12,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-740557754 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-740557754 256)))) (or (and (= ~z$w_buff1~0_In-740557754 |P1Thread1of1ForFork1_#t~ite32_Out-740557754|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In-740557754 |P1Thread1of1ForFork1_#t~ite32_Out-740557754|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-740557754, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-740557754, ~z$w_buff1~0=~z$w_buff1~0_In-740557754, ~z~0=~z~0_In-740557754} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-740557754, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-740557754, ~z$w_buff1~0=~z$w_buff1~0_In-740557754, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-740557754|, ~z~0=~z~0_In-740557754} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:12:12,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_17 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-27 21:12:12,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In165910067 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In165910067 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out165910067| ~z$w_buff0_used~0_In165910067) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out165910067| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In165910067, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In165910067} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In165910067, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out165910067|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In165910067} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:12:12,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1126714947 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1126714947 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1126714947 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1126714947 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1126714947| ~z$w_buff1_used~0_In1126714947) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1126714947| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1126714947, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1126714947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1126714947, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1126714947} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1126714947, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1126714947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1126714947, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1126714947|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1126714947} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:12:12,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1851235533 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1851235533 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1851235533| 0)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1851235533| ~z$r_buff0_thd2~0_In1851235533) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1851235533, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851235533} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1851235533, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851235533, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1851235533|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:12:12,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1951114773 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1951114773 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1951114773 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In1951114773 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1951114773|)) (and (= ~z$r_buff1_thd2~0_In1951114773 |P1Thread1of1ForFork1_#t~ite37_Out1951114773|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1951114773, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1951114773, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951114773, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1951114773} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1951114773, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1951114773, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951114773, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1951114773, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1951114773|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:12:12,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:12:12,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 21:12:12,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-652482962| |ULTIMATE.start_main_#t~ite41_Out-652482962|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-652482962 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-652482962 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-652482962| ~z~0_In-652482962) .cse2) (and (= |ULTIMATE.start_main_#t~ite40_Out-652482962| ~z$w_buff1~0_In-652482962) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-652482962, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-652482962, ~z$w_buff1~0=~z$w_buff1~0_In-652482962, ~z~0=~z~0_In-652482962} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-652482962|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-652482962|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-652482962, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-652482962, ~z$w_buff1~0=~z$w_buff1~0_In-652482962, ~z~0=~z~0_In-652482962} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:12:12,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1019384397 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1019384397 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1019384397| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1019384397 |ULTIMATE.start_main_#t~ite42_Out-1019384397|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1019384397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1019384397} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1019384397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1019384397, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1019384397|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:12:12,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-808941113 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-808941113 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-808941113 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-808941113 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-808941113 |ULTIMATE.start_main_#t~ite43_Out-808941113|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-808941113|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-808941113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-808941113, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-808941113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-808941113} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-808941113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-808941113, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-808941113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-808941113, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-808941113|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:12:12,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-123550946 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-123550946 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-123550946|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-123550946 |ULTIMATE.start_main_#t~ite44_Out-123550946|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-123550946, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-123550946} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-123550946, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-123550946, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-123550946|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:12:12,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-360294425 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-360294425 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-360294425 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-360294425 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-360294425| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-360294425| ~z$r_buff1_thd0~0_In-360294425) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-360294425, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-360294425, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-360294425, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-360294425} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-360294425, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-360294425, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-360294425, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-360294425, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-360294425|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:12:12,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_19) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$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 21:12:12,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:12:12 BasicIcfg [2019-12-27 21:12:12,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:12:12,766 INFO L168 Benchmark]: Toolchain (without parser) took 15335.15 ms. Allocated memory was 146.3 MB in the beginning and 642.3 MB in the end (delta: 496.0 MB). Free memory was 103.0 MB in the beginning and 366.7 MB in the end (delta: -263.6 MB). Peak memory consumption was 232.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:12,767 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:12:12,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.45 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.6 MB in the beginning and 157.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:12,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.22 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:12,775 INFO L168 Benchmark]: Boogie Preprocessor took 40.66 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:12,775 INFO L168 Benchmark]: RCFGBuilder took 797.71 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 108.3 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:12,778 INFO L168 Benchmark]: TraceAbstraction took 13576.54 ms. Allocated memory was 203.4 MB in the beginning and 642.3 MB in the end (delta: 438.8 MB). Free memory was 107.7 MB in the beginning and 366.7 MB in the end (delta: -259.0 MB). Peak memory consumption was 179.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:12,781 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 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.45 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.6 MB in the beginning and 157.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.22 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.66 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.71 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 108.3 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13576.54 ms. Allocated memory was 203.4 MB in the beginning and 642.3 MB in the end (delta: 438.8 MB). Free memory was 107.7 MB in the beginning and 366.7 MB in the end (delta: -259.0 MB). Peak memory consumption was 179.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 148 ProgramPointsBefore, 76 ProgramPointsAfterwards, 182 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 4431 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49804 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2224 SDtfs, 1636 SDslu, 4846 SDs, 0 SdLazy, 3009 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 60 SyntacticMatches, 22 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8066occurred 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, 17 MinimizatonAttempts, 3214 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 56603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...