/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:17:21,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:17:21,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:17:21,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:17:21,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:17:21,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:17:21,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:17:21,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:17:21,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:17:21,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:17:21,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:17:21,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:17:21,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:17:21,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:17:21,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:17:21,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:17:21,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:17:21,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:17:21,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:17:21,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:17:21,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:17:21,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:17:21,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:17:21,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:17:21,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:17:21,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:17:21,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:17:21,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:17:21,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:17:21,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:17:21,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:17:21,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:17:21,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:17:21,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:17:21,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:17:21,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:17:21,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:17:21,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:17:21,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:17:21,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:17:21,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:17:21,168 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.epf [2019-12-18 21:17:21,191 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:17:21,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:17:21,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:17:21,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:17:21,195 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:17:21,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:17:21,195 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:17:21,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:17:21,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:17:21,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:17:21,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:17:21,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:17:21,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:17:21,197 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:17:21,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:17:21,197 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:17:21,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:17:21,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:17:21,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:17:21,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:17:21,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:17:21,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:17:21,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:17:21,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:17:21,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:17:21,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:17:21,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:17:21,200 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:17:21,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:17:21,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:17:21,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:17:21,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:17:21,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:17:21,502 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:17:21,502 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:17:21,503 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2019-12-18 21:17:21,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5caf853/c5c572951fce4e89a64e92f7e01055c2/FLAG753a38688 [2019-12-18 21:17:22,134 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:17:22,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2019-12-18 21:17:22,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5caf853/c5c572951fce4e89a64e92f7e01055c2/FLAG753a38688 [2019-12-18 21:17:22,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5caf853/c5c572951fce4e89a64e92f7e01055c2 [2019-12-18 21:17:22,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:17:22,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:17:22,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:17:22,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:17:22,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:17:22,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:17:22" (1/1) ... [2019-12-18 21:17:22,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e78abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:22, skipping insertion in model container [2019-12-18 21:17:22,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:17:22" (1/1) ... [2019-12-18 21:17:22,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:17:22,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:17:23,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:17:23,107 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:17:23,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:17:23,255 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:17:23,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23 WrapperNode [2019-12-18 21:17:23,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:17:23,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:17:23,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:17:23,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:17:23,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... [2019-12-18 21:17:23,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... [2019-12-18 21:17:23,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:17:23,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:17:23,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:17:23,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:17:23,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... [2019-12-18 21:17:23,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... [2019-12-18 21:17:23,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... [2019-12-18 21:17:23,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... [2019-12-18 21:17:23,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... [2019-12-18 21:17:23,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... [2019-12-18 21:17:23,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... [2019-12-18 21:17:23,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:17:23,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:17:23,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:17:23,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:17:23,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:17:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:17:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:17:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:17:23,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:17:23,457 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:17:23,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:17:23,458 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:17:23,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:17:23,460 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:17:23,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:17:23,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:17:23,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:17:23,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:17:23,464 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:17:24,297 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:17:24,298 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:17:24,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:17:24 BoogieIcfgContainer [2019-12-18 21:17:24,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:17:24,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:17:24,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:17:24,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:17:24,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:17:22" (1/3) ... [2019-12-18 21:17:24,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3447f932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:17:24, skipping insertion in model container [2019-12-18 21:17:24,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:17:23" (2/3) ... [2019-12-18 21:17:24,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3447f932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:17:24, skipping insertion in model container [2019-12-18 21:17:24,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:17:24" (3/3) ... [2019-12-18 21:17:24,310 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc.i [2019-12-18 21:17:24,321 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:17:24,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:17:24,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:17:24,334 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:17:24,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,435 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,435 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,450 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,451 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,483 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,485 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,510 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,510 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:17:24,540 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:17:24,562 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:17:24,563 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:17:24,563 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:17:24,563 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:17:24,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:17:24,563 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:17:24,563 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:17:24,563 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:17:24,584 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 21:17:24,586 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 21:17:24,700 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 21:17:24,700 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:17:24,725 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:17:24,751 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 21:17:24,822 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 21:17:24,822 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:17:24,830 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:17:24,852 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:17:24,854 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:17:28,518 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 21:17:28,649 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:17:28,670 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-18 21:17:28,670 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 21:17:28,674 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 21:17:44,269 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-18 21:17:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-18 21:17:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:17:44,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:17:44,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:17:44,278 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:17:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:17:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-18 21:17:44,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:17:44,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407786890] [2019-12-18 21:17:44,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:17:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:17:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:17:44,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407786890] [2019-12-18 21:17:44,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:17:44,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:17:44,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794590433] [2019-12-18 21:17:44,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:17:44,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:17:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:17:44,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:17:44,534 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-18 21:17:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:17:47,524 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-18 21:17:47,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:17:47,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:17:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:17:48,097 INFO L225 Difference]: With dead ends: 104092 [2019-12-18 21:17:48,097 INFO L226 Difference]: Without dead ends: 97696 [2019-12-18 21:17:48,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:17:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-18 21:17:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-18 21:17:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-18 21:17:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-18 21:17:56,688 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-18 21:17:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:17:56,688 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-18 21:17:56,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:17:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-18 21:17:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:17:56,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:17:56,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:17:56,693 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:17:56,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:17:56,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-18 21:17:56,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:17:56,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673118101] [2019-12-18 21:17:56,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:17:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:17:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:17:56,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673118101] [2019-12-18 21:17:56,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:17:56,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:17:56,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25410347] [2019-12-18 21:17:56,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:17:56,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:17:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:17:56,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:17:56,839 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-18 21:18:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:01,905 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-18 21:18:01,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:18:01,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:18:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:02,536 INFO L225 Difference]: With dead ends: 155904 [2019-12-18 21:18:02,537 INFO L226 Difference]: Without dead ends: 155855 [2019-12-18 21:18:02,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-18 21:18:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-18 21:18:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-18 21:18:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-18 21:18:11,711 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-18 21:18:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:11,712 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-18 21:18:11,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:18:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-18 21:18:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:18:11,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:11,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:11,718 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:11,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:11,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-18 21:18:11,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:11,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003910927] [2019-12-18 21:18:11,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:11,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003910927] [2019-12-18 21:18:11,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:11,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:18:11,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646652086] [2019-12-18 21:18:11,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:11,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:11,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:11,774 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-18 21:18:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:11,912 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-18 21:18:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:11,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:18:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:11,967 INFO L225 Difference]: With dead ends: 31684 [2019-12-18 21:18:11,967 INFO L226 Difference]: Without dead ends: 31684 [2019-12-18 21:18:11,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-18 21:18:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-18 21:18:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-18 21:18:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-18 21:18:17,181 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-18 21:18:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:17,182 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-18 21:18:17,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-18 21:18:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:18:17,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:17,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:17,186 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-18 21:18:17,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:17,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028977979] [2019-12-18 21:18:17,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:17,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028977979] [2019-12-18 21:18:17,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:17,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:18:17,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093774483] [2019-12-18 21:18:17,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:18:17,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:18:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:18:17,288 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-18 21:18:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:17,663 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-18 21:18:17,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:18:17,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:18:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:17,758 INFO L225 Difference]: With dead ends: 39269 [2019-12-18 21:18:17,758 INFO L226 Difference]: Without dead ends: 39269 [2019-12-18 21:18:17,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-18 21:18:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-18 21:18:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-18 21:18:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-18 21:18:18,404 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-18 21:18:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:18,406 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-18 21:18:18,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:18:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-18 21:18:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:18:18,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:18,414 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] [2019-12-18 21:18:18,415 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-18 21:18:18,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:18,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17197173] [2019-12-18 21:18:18,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:18,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17197173] [2019-12-18 21:18:18,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:18,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:18:18,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529287281] [2019-12-18 21:18:18,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:18:18,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:18:18,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:18:18,582 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 6 states. [2019-12-18 21:18:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:19,755 INFO L93 Difference]: Finished difference Result 46852 states and 149591 transitions. [2019-12-18 21:18:19,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:18:19,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:18:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:19,835 INFO L225 Difference]: With dead ends: 46852 [2019-12-18 21:18:19,835 INFO L226 Difference]: Without dead ends: 46852 [2019-12-18 21:18:19,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:18:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46852 states. [2019-12-18 21:18:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46852 to 35192. [2019-12-18 21:18:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35192 states. [2019-12-18 21:18:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35192 states to 35192 states and 113953 transitions. [2019-12-18 21:18:20,564 INFO L78 Accepts]: Start accepts. Automaton has 35192 states and 113953 transitions. Word has length 22 [2019-12-18 21:18:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:20,565 INFO L462 AbstractCegarLoop]: Abstraction has 35192 states and 113953 transitions. [2019-12-18 21:18:20,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:18:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 35192 states and 113953 transitions. [2019-12-18 21:18:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:18:20,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:20,572 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] [2019-12-18 21:18:20,573 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:20,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1330562352, now seen corresponding path program 2 times [2019-12-18 21:18:20,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:20,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830528841] [2019-12-18 21:18:20,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:20,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830528841] [2019-12-18 21:18:20,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:20,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:18:20,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927667799] [2019-12-18 21:18:20,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:18:20,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:20,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:18:20,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:20,654 INFO L87 Difference]: Start difference. First operand 35192 states and 113953 transitions. Second operand 5 states. [2019-12-18 21:18:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:21,291 INFO L93 Difference]: Finished difference Result 44071 states and 140387 transitions. [2019-12-18 21:18:21,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:18:21,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 21:18:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:21,364 INFO L225 Difference]: With dead ends: 44071 [2019-12-18 21:18:21,364 INFO L226 Difference]: Without dead ends: 44064 [2019-12-18 21:18:21,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:18:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44064 states. [2019-12-18 21:18:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44064 to 34769. [2019-12-18 21:18:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34769 states. [2019-12-18 21:18:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34769 states to 34769 states and 112450 transitions. [2019-12-18 21:18:22,352 INFO L78 Accepts]: Start accepts. Automaton has 34769 states and 112450 transitions. Word has length 22 [2019-12-18 21:18:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:22,352 INFO L462 AbstractCegarLoop]: Abstraction has 34769 states and 112450 transitions. [2019-12-18 21:18:22,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:18:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 34769 states and 112450 transitions. [2019-12-18 21:18:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:18:22,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:22,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:22,365 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-18 21:18:22,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:22,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754854993] [2019-12-18 21:18:22,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:22,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754854993] [2019-12-18 21:18:22,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:22,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:18:22,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694833341] [2019-12-18 21:18:22,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:18:22,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:22,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:18:22,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:18:22,442 INFO L87 Difference]: Start difference. First operand 34769 states and 112450 transitions. Second operand 4 states. [2019-12-18 21:18:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:22,510 INFO L93 Difference]: Finished difference Result 14037 states and 42756 transitions. [2019-12-18 21:18:22,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:18:22,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:18:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:22,533 INFO L225 Difference]: With dead ends: 14037 [2019-12-18 21:18:22,533 INFO L226 Difference]: Without dead ends: 14037 [2019-12-18 21:18:22,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:18:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-12-18 21:18:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 13737. [2019-12-18 21:18:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13737 states. [2019-12-18 21:18:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 41900 transitions. [2019-12-18 21:18:22,744 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 41900 transitions. Word has length 25 [2019-12-18 21:18:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:22,745 INFO L462 AbstractCegarLoop]: Abstraction has 13737 states and 41900 transitions. [2019-12-18 21:18:22,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:18:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 41900 transitions. [2019-12-18 21:18:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:18:22,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:22,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:22,755 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:22,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-18 21:18:22,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:22,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943177613] [2019-12-18 21:18:22,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:22,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943177613] [2019-12-18 21:18:22,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:22,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:18:22,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196661520] [2019-12-18 21:18:22,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:22,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:22,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:22,803 INFO L87 Difference]: Start difference. First operand 13737 states and 41900 transitions. Second operand 3 states. [2019-12-18 21:18:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:22,895 INFO L93 Difference]: Finished difference Result 19578 states and 58726 transitions. [2019-12-18 21:18:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:22,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 21:18:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:22,922 INFO L225 Difference]: With dead ends: 19578 [2019-12-18 21:18:22,922 INFO L226 Difference]: Without dead ends: 19578 [2019-12-18 21:18:22,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-18 21:18:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 14483. [2019-12-18 21:18:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14483 states. [2019-12-18 21:18:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 44038 transitions. [2019-12-18 21:18:23,174 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 44038 transitions. Word has length 27 [2019-12-18 21:18:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:23,174 INFO L462 AbstractCegarLoop]: Abstraction has 14483 states and 44038 transitions. [2019-12-18 21:18:23,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 44038 transitions. [2019-12-18 21:18:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:18:23,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:23,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:23,186 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:23,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:23,186 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-18 21:18:23,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:23,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436602144] [2019-12-18 21:18:23,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:23,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436602144] [2019-12-18 21:18:23,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:23,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:18:23,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084318695] [2019-12-18 21:18:23,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:18:23,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:23,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:18:23,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:18:23,266 INFO L87 Difference]: Start difference. First operand 14483 states and 44038 transitions. Second operand 6 states. [2019-12-18 21:18:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:24,212 INFO L93 Difference]: Finished difference Result 37116 states and 111354 transitions. [2019-12-18 21:18:24,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:18:24,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:18:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:24,267 INFO L225 Difference]: With dead ends: 37116 [2019-12-18 21:18:24,267 INFO L226 Difference]: Without dead ends: 37116 [2019-12-18 21:18:24,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:18:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37116 states. [2019-12-18 21:18:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37116 to 20406. [2019-12-18 21:18:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-18 21:18:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 62975 transitions. [2019-12-18 21:18:24,690 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 62975 transitions. Word has length 27 [2019-12-18 21:18:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:24,690 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 62975 transitions. [2019-12-18 21:18:24,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:18:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 62975 transitions. [2019-12-18 21:18:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:18:24,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:24,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:24,706 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-18 21:18:24,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:24,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852300789] [2019-12-18 21:18:24,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:24,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852300789] [2019-12-18 21:18:24,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:24,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:18:24,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591563008] [2019-12-18 21:18:24,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:18:24,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:18:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:18:24,797 INFO L87 Difference]: Start difference. First operand 20406 states and 62975 transitions. Second operand 6 states. [2019-12-18 21:18:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:25,538 INFO L93 Difference]: Finished difference Result 34406 states and 103090 transitions. [2019-12-18 21:18:25,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:18:25,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 21:18:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:25,589 INFO L225 Difference]: With dead ends: 34406 [2019-12-18 21:18:25,590 INFO L226 Difference]: Without dead ends: 34406 [2019-12-18 21:18:25,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:18:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34406 states. [2019-12-18 21:18:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34406 to 20168. [2019-12-18 21:18:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20168 states. [2019-12-18 21:18:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20168 states to 20168 states and 62360 transitions. [2019-12-18 21:18:26,007 INFO L78 Accepts]: Start accepts. Automaton has 20168 states and 62360 transitions. Word has length 28 [2019-12-18 21:18:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:26,007 INFO L462 AbstractCegarLoop]: Abstraction has 20168 states and 62360 transitions. [2019-12-18 21:18:26,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:18:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 20168 states and 62360 transitions. [2019-12-18 21:18:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:18:26,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:26,031 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] [2019-12-18 21:18:26,031 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:26,031 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-18 21:18:26,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:26,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859121704] [2019-12-18 21:18:26,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:26,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859121704] [2019-12-18 21:18:26,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:26,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:18:26,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950447648] [2019-12-18 21:18:26,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:18:26,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:18:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:18:26,126 INFO L87 Difference]: Start difference. First operand 20168 states and 62360 transitions. Second operand 7 states. [2019-12-18 21:18:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:27,769 INFO L93 Difference]: Finished difference Result 46484 states and 138742 transitions. [2019-12-18 21:18:27,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:18:27,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:18:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:27,836 INFO L225 Difference]: With dead ends: 46484 [2019-12-18 21:18:27,836 INFO L226 Difference]: Without dead ends: 46484 [2019-12-18 21:18:27,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 21:18:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46484 states. [2019-12-18 21:18:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46484 to 21453. [2019-12-18 21:18:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21453 states. [2019-12-18 21:18:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21453 states to 21453 states and 66323 transitions. [2019-12-18 21:18:28,325 INFO L78 Accepts]: Start accepts. Automaton has 21453 states and 66323 transitions. Word has length 33 [2019-12-18 21:18:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:28,325 INFO L462 AbstractCegarLoop]: Abstraction has 21453 states and 66323 transitions. [2019-12-18 21:18:28,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:18:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 21453 states and 66323 transitions. [2019-12-18 21:18:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:18:28,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:28,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:28,348 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-18 21:18:28,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:28,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992828876] [2019-12-18 21:18:28,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:28,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992828876] [2019-12-18 21:18:28,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:28,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:18:28,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292466907] [2019-12-18 21:18:28,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:28,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:28,393 INFO L87 Difference]: Start difference. First operand 21453 states and 66323 transitions. Second operand 3 states. [2019-12-18 21:18:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:28,546 INFO L93 Difference]: Finished difference Result 28695 states and 85797 transitions. [2019-12-18 21:18:28,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:28,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 21:18:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:28,612 INFO L225 Difference]: With dead ends: 28695 [2019-12-18 21:18:28,612 INFO L226 Difference]: Without dead ends: 28695 [2019-12-18 21:18:28,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28695 states. [2019-12-18 21:18:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28695 to 20429. [2019-12-18 21:18:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20429 states. [2019-12-18 21:18:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20429 states to 20429 states and 61176 transitions. [2019-12-18 21:18:29,177 INFO L78 Accepts]: Start accepts. Automaton has 20429 states and 61176 transitions. Word has length 33 [2019-12-18 21:18:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:29,177 INFO L462 AbstractCegarLoop]: Abstraction has 20429 states and 61176 transitions. [2019-12-18 21:18:29,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 20429 states and 61176 transitions. [2019-12-18 21:18:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:18:29,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:29,201 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] [2019-12-18 21:18:29,201 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-18 21:18:29,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:29,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234283627] [2019-12-18 21:18:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:29,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234283627] [2019-12-18 21:18:29,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:29,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:18:29,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168158315] [2019-12-18 21:18:29,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:18:29,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:18:29,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:18:29,304 INFO L87 Difference]: Start difference. First operand 20429 states and 61176 transitions. Second operand 8 states. [2019-12-18 21:18:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:31,183 INFO L93 Difference]: Finished difference Result 45938 states and 134554 transitions. [2019-12-18 21:18:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 21:18:31,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 21:18:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:31,241 INFO L225 Difference]: With dead ends: 45938 [2019-12-18 21:18:31,241 INFO L226 Difference]: Without dead ends: 45938 [2019-12-18 21:18:31,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:18:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45938 states. [2019-12-18 21:18:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45938 to 19869. [2019-12-18 21:18:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19869 states. [2019-12-18 21:18:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19869 states to 19869 states and 59508 transitions. [2019-12-18 21:18:31,704 INFO L78 Accepts]: Start accepts. Automaton has 19869 states and 59508 transitions. Word has length 33 [2019-12-18 21:18:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:31,704 INFO L462 AbstractCegarLoop]: Abstraction has 19869 states and 59508 transitions. [2019-12-18 21:18:31,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:18:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 19869 states and 59508 transitions. [2019-12-18 21:18:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:18:31,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:31,721 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] [2019-12-18 21:18:31,722 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-18 21:18:31,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:31,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736568015] [2019-12-18 21:18:31,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:31,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736568015] [2019-12-18 21:18:31,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:31,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:18:31,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768788071] [2019-12-18 21:18:31,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:18:31,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:18:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:18:31,850 INFO L87 Difference]: Start difference. First operand 19869 states and 59508 transitions. Second operand 7 states. [2019-12-18 21:18:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:33,193 INFO L93 Difference]: Finished difference Result 35347 states and 103679 transitions. [2019-12-18 21:18:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:18:33,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 21:18:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:33,243 INFO L225 Difference]: With dead ends: 35347 [2019-12-18 21:18:33,243 INFO L226 Difference]: Without dead ends: 35347 [2019-12-18 21:18:33,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:18:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35347 states. [2019-12-18 21:18:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35347 to 18737. [2019-12-18 21:18:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18737 states. [2019-12-18 21:18:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18737 states to 18737 states and 56205 transitions. [2019-12-18 21:18:33,648 INFO L78 Accepts]: Start accepts. Automaton has 18737 states and 56205 transitions. Word has length 34 [2019-12-18 21:18:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:33,648 INFO L462 AbstractCegarLoop]: Abstraction has 18737 states and 56205 transitions. [2019-12-18 21:18:33,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:18:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18737 states and 56205 transitions. [2019-12-18 21:18:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:18:33,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:33,665 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] [2019-12-18 21:18:33,665 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-18 21:18:33,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:33,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111894664] [2019-12-18 21:18:33,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:33,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-18 21:18:33,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111894664] [2019-12-18 21:18:33,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:33,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:18:33,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462999668] [2019-12-18 21:18:33,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:18:33,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:18:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:18:33,818 INFO L87 Difference]: Start difference. First operand 18737 states and 56205 transitions. Second operand 9 states. [2019-12-18 21:18:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:36,037 INFO L93 Difference]: Finished difference Result 39386 states and 114845 transitions. [2019-12-18 21:18:36,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 21:18:36,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 21:18:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:36,129 INFO L225 Difference]: With dead ends: 39386 [2019-12-18 21:18:36,130 INFO L226 Difference]: Without dead ends: 39386 [2019-12-18 21:18:36,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:18:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39386 states. [2019-12-18 21:18:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39386 to 18389. [2019-12-18 21:18:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18389 states. [2019-12-18 21:18:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18389 states to 18389 states and 55187 transitions. [2019-12-18 21:18:36,635 INFO L78 Accepts]: Start accepts. Automaton has 18389 states and 55187 transitions. Word has length 34 [2019-12-18 21:18:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:36,635 INFO L462 AbstractCegarLoop]: Abstraction has 18389 states and 55187 transitions. [2019-12-18 21:18:36,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:18:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 18389 states and 55187 transitions. [2019-12-18 21:18:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:18:36,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:36,661 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] [2019-12-18 21:18:36,662 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:36,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash -903409010, now seen corresponding path program 1 times [2019-12-18 21:18:36,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:36,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985996619] [2019-12-18 21:18:36,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:36,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985996619] [2019-12-18 21:18:36,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:36,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:18:36,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254464456] [2019-12-18 21:18:36,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:36,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:36,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:36,715 INFO L87 Difference]: Start difference. First operand 18389 states and 55187 transitions. Second operand 3 states. [2019-12-18 21:18:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:36,846 INFO L93 Difference]: Finished difference Result 30850 states and 92853 transitions. [2019-12-18 21:18:36,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:36,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 21:18:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:36,877 INFO L225 Difference]: With dead ends: 30850 [2019-12-18 21:18:36,877 INFO L226 Difference]: Without dead ends: 15350 [2019-12-18 21:18:36,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15350 states. [2019-12-18 21:18:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15350 to 15241. [2019-12-18 21:18:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15241 states. [2019-12-18 21:18:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15241 states to 15241 states and 44864 transitions. [2019-12-18 21:18:37,133 INFO L78 Accepts]: Start accepts. Automaton has 15241 states and 44864 transitions. Word has length 39 [2019-12-18 21:18:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:37,133 INFO L462 AbstractCegarLoop]: Abstraction has 15241 states and 44864 transitions. [2019-12-18 21:18:37,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 15241 states and 44864 transitions. [2019-12-18 21:18:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:18:37,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:37,153 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] [2019-12-18 21:18:37,153 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2089566008, now seen corresponding path program 2 times [2019-12-18 21:18:37,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:37,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864951043] [2019-12-18 21:18:37,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:37,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864951043] [2019-12-18 21:18:37,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:37,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:18:37,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834499493] [2019-12-18 21:18:37,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:37,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:37,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:37,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:37,208 INFO L87 Difference]: Start difference. First operand 15241 states and 44864 transitions. Second operand 3 states. [2019-12-18 21:18:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:37,270 INFO L93 Difference]: Finished difference Result 15240 states and 44862 transitions. [2019-12-18 21:18:37,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:37,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 21:18:37,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:37,297 INFO L225 Difference]: With dead ends: 15240 [2019-12-18 21:18:37,298 INFO L226 Difference]: Without dead ends: 15240 [2019-12-18 21:18:37,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-12-18 21:18:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 15240. [2019-12-18 21:18:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-12-18 21:18:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 44862 transitions. [2019-12-18 21:18:37,527 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 44862 transitions. Word has length 39 [2019-12-18 21:18:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:37,527 INFO L462 AbstractCegarLoop]: Abstraction has 15240 states and 44862 transitions. [2019-12-18 21:18:37,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 44862 transitions. [2019-12-18 21:18:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:18:37,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:37,542 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] [2019-12-18 21:18:37,542 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:37,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:37,542 INFO L82 PathProgramCache]: Analyzing trace with hash 860206803, now seen corresponding path program 1 times [2019-12-18 21:18:37,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:37,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306528520] [2019-12-18 21:18:37,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:37,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306528520] [2019-12-18 21:18:37,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:37,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:18:37,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352390019] [2019-12-18 21:18:37,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:18:37,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:18:37,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:18:37,587 INFO L87 Difference]: Start difference. First operand 15240 states and 44862 transitions. Second operand 4 states. [2019-12-18 21:18:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:37,698 INFO L93 Difference]: Finished difference Result 23923 states and 70858 transitions. [2019-12-18 21:18:37,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:18:37,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 21:18:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:37,721 INFO L225 Difference]: With dead ends: 23923 [2019-12-18 21:18:37,721 INFO L226 Difference]: Without dead ends: 9775 [2019-12-18 21:18:37,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:37,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9775 states. [2019-12-18 21:18:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9775 to 9772. [2019-12-18 21:18:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9772 states. [2019-12-18 21:18:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9772 states to 9772 states and 28613 transitions. [2019-12-18 21:18:37,917 INFO L78 Accepts]: Start accepts. Automaton has 9772 states and 28613 transitions. Word has length 40 [2019-12-18 21:18:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:37,918 INFO L462 AbstractCegarLoop]: Abstraction has 9772 states and 28613 transitions. [2019-12-18 21:18:38,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:18:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 9772 states and 28613 transitions. [2019-12-18 21:18:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:18:38,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:38,023 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] [2019-12-18 21:18:38,023 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1423567527, now seen corresponding path program 2 times [2019-12-18 21:18:38,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:38,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96844448] [2019-12-18 21:18:38,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:38,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96844448] [2019-12-18 21:18:38,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:38,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:18:38,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019066510] [2019-12-18 21:18:38,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:18:38,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:38,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:18:38,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:38,106 INFO L87 Difference]: Start difference. First operand 9772 states and 28613 transitions. Second operand 5 states. [2019-12-18 21:18:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:38,754 INFO L93 Difference]: Finished difference Result 17462 states and 49883 transitions. [2019-12-18 21:18:38,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:18:38,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:18:38,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:38,779 INFO L225 Difference]: With dead ends: 17462 [2019-12-18 21:18:38,779 INFO L226 Difference]: Without dead ends: 17462 [2019-12-18 21:18:38,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:18:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17462 states. [2019-12-18 21:18:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17462 to 15637. [2019-12-18 21:18:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15637 states. [2019-12-18 21:18:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15637 states to 15637 states and 45392 transitions. [2019-12-18 21:18:39,036 INFO L78 Accepts]: Start accepts. Automaton has 15637 states and 45392 transitions. Word has length 40 [2019-12-18 21:18:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:39,036 INFO L462 AbstractCegarLoop]: Abstraction has 15637 states and 45392 transitions. [2019-12-18 21:18:39,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:18:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 15637 states and 45392 transitions. [2019-12-18 21:18:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:18:39,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:39,052 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] [2019-12-18 21:18:39,052 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:39,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:39,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 3 times [2019-12-18 21:18:39,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:39,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434466598] [2019-12-18 21:18:39,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:39,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434466598] [2019-12-18 21:18:39,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:39,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:18:39,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178268061] [2019-12-18 21:18:39,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:18:39,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:39,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:18:39,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:39,109 INFO L87 Difference]: Start difference. First operand 15637 states and 45392 transitions. Second operand 5 states. [2019-12-18 21:18:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:39,187 INFO L93 Difference]: Finished difference Result 14556 states and 42923 transitions. [2019-12-18 21:18:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:18:39,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:18:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:39,208 INFO L225 Difference]: With dead ends: 14556 [2019-12-18 21:18:39,209 INFO L226 Difference]: Without dead ends: 12170 [2019-12-18 21:18:39,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 21:18:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-12-18 21:18:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11596. [2019-12-18 21:18:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11596 states. [2019-12-18 21:18:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 36063 transitions. [2019-12-18 21:18:39,401 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 36063 transitions. Word has length 40 [2019-12-18 21:18:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:39,402 INFO L462 AbstractCegarLoop]: Abstraction has 11596 states and 36063 transitions. [2019-12-18 21:18:39,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:18:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 36063 transitions. [2019-12-18 21:18:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:18:39,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:39,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:39,415 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:39,415 INFO L82 PathProgramCache]: Analyzing trace with hash -739440714, now seen corresponding path program 1 times [2019-12-18 21:18:39,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:39,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718245272] [2019-12-18 21:18:39,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:39,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718245272] [2019-12-18 21:18:39,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:39,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:18:39,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931919730] [2019-12-18 21:18:39,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:18:39,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:18:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:18:39,515 INFO L87 Difference]: Start difference. First operand 11596 states and 36063 transitions. Second operand 8 states. [2019-12-18 21:18:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:40,392 INFO L93 Difference]: Finished difference Result 32945 states and 100223 transitions. [2019-12-18 21:18:40,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:18:40,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 21:18:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:40,424 INFO L225 Difference]: With dead ends: 32945 [2019-12-18 21:18:40,424 INFO L226 Difference]: Without dead ends: 23571 [2019-12-18 21:18:40,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:18:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23571 states. [2019-12-18 21:18:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23571 to 13293. [2019-12-18 21:18:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13293 states. [2019-12-18 21:18:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13293 states to 13293 states and 41169 transitions. [2019-12-18 21:18:40,703 INFO L78 Accepts]: Start accepts. Automaton has 13293 states and 41169 transitions. Word has length 64 [2019-12-18 21:18:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:40,704 INFO L462 AbstractCegarLoop]: Abstraction has 13293 states and 41169 transitions. [2019-12-18 21:18:40,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:18:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 13293 states and 41169 transitions. [2019-12-18 21:18:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:18:40,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:40,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:40,719 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:40,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2017353844, now seen corresponding path program 2 times [2019-12-18 21:18:40,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:40,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212695297] [2019-12-18 21:18:40,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:40,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212695297] [2019-12-18 21:18:40,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:40,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:18:40,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910546820] [2019-12-18 21:18:40,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:18:40,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:40,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:18:40,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:18:40,817 INFO L87 Difference]: Start difference. First operand 13293 states and 41169 transitions. Second operand 7 states. [2019-12-18 21:18:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:41,104 INFO L93 Difference]: Finished difference Result 24451 states and 74207 transitions. [2019-12-18 21:18:41,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:18:41,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:18:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:41,131 INFO L225 Difference]: With dead ends: 24451 [2019-12-18 21:18:41,131 INFO L226 Difference]: Without dead ends: 17164 [2019-12-18 21:18:41,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:18:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states. [2019-12-18 21:18:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 15061. [2019-12-18 21:18:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15061 states. [2019-12-18 21:18:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15061 states to 15061 states and 46209 transitions. [2019-12-18 21:18:41,492 INFO L78 Accepts]: Start accepts. Automaton has 15061 states and 46209 transitions. Word has length 64 [2019-12-18 21:18:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:41,492 INFO L462 AbstractCegarLoop]: Abstraction has 15061 states and 46209 transitions. [2019-12-18 21:18:41,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:18:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 15061 states and 46209 transitions. [2019-12-18 21:18:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:18:41,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:41,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:41,508 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1729634848, now seen corresponding path program 3 times [2019-12-18 21:18:41,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:41,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224686603] [2019-12-18 21:18:41,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:41,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224686603] [2019-12-18 21:18:41,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:41,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:18:41,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010724704] [2019-12-18 21:18:41,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:18:41,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:41,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:18:41,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:18:41,637 INFO L87 Difference]: Start difference. First operand 15061 states and 46209 transitions. Second operand 9 states. [2019-12-18 21:18:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:42,867 INFO L93 Difference]: Finished difference Result 48515 states and 146959 transitions. [2019-12-18 21:18:42,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:18:42,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 21:18:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:42,930 INFO L225 Difference]: With dead ends: 48515 [2019-12-18 21:18:42,931 INFO L226 Difference]: Without dead ends: 44943 [2019-12-18 21:18:42,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:18:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44943 states. [2019-12-18 21:18:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44943 to 15502. [2019-12-18 21:18:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15502 states. [2019-12-18 21:18:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15502 states to 15502 states and 47655 transitions. [2019-12-18 21:18:43,377 INFO L78 Accepts]: Start accepts. Automaton has 15502 states and 47655 transitions. Word has length 64 [2019-12-18 21:18:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:43,377 INFO L462 AbstractCegarLoop]: Abstraction has 15502 states and 47655 transitions. [2019-12-18 21:18:43,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:18:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 15502 states and 47655 transitions. [2019-12-18 21:18:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:18:43,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:43,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:43,395 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:43,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:43,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1593875220, now seen corresponding path program 4 times [2019-12-18 21:18:43,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:43,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721204833] [2019-12-18 21:18:43,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:43,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721204833] [2019-12-18 21:18:43,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:43,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:18:43,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349742558] [2019-12-18 21:18:43,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:18:43,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:18:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:18:43,506 INFO L87 Difference]: Start difference. First operand 15502 states and 47655 transitions. Second operand 9 states. [2019-12-18 21:18:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:44,600 INFO L93 Difference]: Finished difference Result 36657 states and 110919 transitions. [2019-12-18 21:18:44,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 21:18:44,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 21:18:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:44,646 INFO L225 Difference]: With dead ends: 36657 [2019-12-18 21:18:44,647 INFO L226 Difference]: Without dead ends: 33893 [2019-12-18 21:18:44,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:18:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33893 states. [2019-12-18 21:18:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33893 to 15329. [2019-12-18 21:18:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15329 states. [2019-12-18 21:18:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15329 states to 15329 states and 47228 transitions. [2019-12-18 21:18:45,020 INFO L78 Accepts]: Start accepts. Automaton has 15329 states and 47228 transitions. Word has length 64 [2019-12-18 21:18:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:45,020 INFO L462 AbstractCegarLoop]: Abstraction has 15329 states and 47228 transitions. [2019-12-18 21:18:45,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:18:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 15329 states and 47228 transitions. [2019-12-18 21:18:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:18:45,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:45,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:45,038 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1686766406, now seen corresponding path program 5 times [2019-12-18 21:18:45,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:45,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345213812] [2019-12-18 21:18:45,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:45,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345213812] [2019-12-18 21:18:45,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:45,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:18:45,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015638922] [2019-12-18 21:18:45,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:18:45,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:45,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:18:45,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:18:45,115 INFO L87 Difference]: Start difference. First operand 15329 states and 47228 transitions. Second operand 7 states. [2019-12-18 21:18:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:45,518 INFO L93 Difference]: Finished difference Result 27077 states and 82041 transitions. [2019-12-18 21:18:45,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:18:45,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:18:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:45,544 INFO L225 Difference]: With dead ends: 27077 [2019-12-18 21:18:45,545 INFO L226 Difference]: Without dead ends: 19995 [2019-12-18 21:18:45,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:18:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19995 states. [2019-12-18 21:18:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19995 to 15617. [2019-12-18 21:18:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15617 states. [2019-12-18 21:18:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15617 states to 15617 states and 48080 transitions. [2019-12-18 21:18:45,803 INFO L78 Accepts]: Start accepts. Automaton has 15617 states and 48080 transitions. Word has length 64 [2019-12-18 21:18:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:45,803 INFO L462 AbstractCegarLoop]: Abstraction has 15617 states and 48080 transitions. [2019-12-18 21:18:45,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:18:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15617 states and 48080 transitions. [2019-12-18 21:18:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:18:45,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:45,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:45,820 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:45,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:45,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2083011794, now seen corresponding path program 6 times [2019-12-18 21:18:45,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:45,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015483337] [2019-12-18 21:18:45,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:45,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015483337] [2019-12-18 21:18:45,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:45,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:18:45,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534287242] [2019-12-18 21:18:45,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:18:45,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:45,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:18:45,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:18:45,931 INFO L87 Difference]: Start difference. First operand 15617 states and 48080 transitions. Second operand 7 states. [2019-12-18 21:18:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:47,369 INFO L93 Difference]: Finished difference Result 27465 states and 84063 transitions. [2019-12-18 21:18:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:18:47,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:18:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:47,409 INFO L225 Difference]: With dead ends: 27465 [2019-12-18 21:18:47,410 INFO L226 Difference]: Without dead ends: 27465 [2019-12-18 21:18:47,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:18:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27465 states. [2019-12-18 21:18:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27465 to 15841. [2019-12-18 21:18:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15841 states. [2019-12-18 21:18:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15841 states to 15841 states and 48930 transitions. [2019-12-18 21:18:47,751 INFO L78 Accepts]: Start accepts. Automaton has 15841 states and 48930 transitions. Word has length 64 [2019-12-18 21:18:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:47,751 INFO L462 AbstractCegarLoop]: Abstraction has 15841 states and 48930 transitions. [2019-12-18 21:18:47,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:18:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 15841 states and 48930 transitions. [2019-12-18 21:18:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:18:47,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:47,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:47,767 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:47,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2033773150, now seen corresponding path program 7 times [2019-12-18 21:18:47,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:47,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510011703] [2019-12-18 21:18:47,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:47,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510011703] [2019-12-18 21:18:47,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:47,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:18:47,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344100665] [2019-12-18 21:18:47,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:18:47,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:18:47,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:18:47,933 INFO L87 Difference]: Start difference. First operand 15841 states and 48930 transitions. Second operand 8 states. [2019-12-18 21:18:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:49,622 INFO L93 Difference]: Finished difference Result 30434 states and 93500 transitions. [2019-12-18 21:18:49,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:18:49,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 21:18:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:49,669 INFO L225 Difference]: With dead ends: 30434 [2019-12-18 21:18:49,669 INFO L226 Difference]: Without dead ends: 30434 [2019-12-18 21:18:49,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:18:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30434 states. [2019-12-18 21:18:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30434 to 15841. [2019-12-18 21:18:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15841 states. [2019-12-18 21:18:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15841 states to 15841 states and 48930 transitions. [2019-12-18 21:18:50,215 INFO L78 Accepts]: Start accepts. Automaton has 15841 states and 48930 transitions. Word has length 64 [2019-12-18 21:18:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:50,215 INFO L462 AbstractCegarLoop]: Abstraction has 15841 states and 48930 transitions. [2019-12-18 21:18:50,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:18:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 15841 states and 48930 transitions. [2019-12-18 21:18:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:18:50,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:50,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:50,231 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1056383140, now seen corresponding path program 8 times [2019-12-18 21:18:50,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:50,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058851113] [2019-12-18 21:18:50,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:50,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058851113] [2019-12-18 21:18:50,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:50,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:18:50,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229537304] [2019-12-18 21:18:50,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:50,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:50,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:50,281 INFO L87 Difference]: Start difference. First operand 15841 states and 48930 transitions. Second operand 3 states. [2019-12-18 21:18:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:50,411 INFO L93 Difference]: Finished difference Result 18111 states and 55868 transitions. [2019-12-18 21:18:50,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:50,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 21:18:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:50,443 INFO L225 Difference]: With dead ends: 18111 [2019-12-18 21:18:50,444 INFO L226 Difference]: Without dead ends: 18111 [2019-12-18 21:18:50,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18111 states. [2019-12-18 21:18:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18111 to 15629. [2019-12-18 21:18:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15629 states. [2019-12-18 21:18:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15629 states to 15629 states and 48434 transitions. [2019-12-18 21:18:50,707 INFO L78 Accepts]: Start accepts. Automaton has 15629 states and 48434 transitions. Word has length 64 [2019-12-18 21:18:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:50,708 INFO L462 AbstractCegarLoop]: Abstraction has 15629 states and 48434 transitions. [2019-12-18 21:18:50,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15629 states and 48434 transitions. [2019-12-18 21:18:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:18:50,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:50,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:50,725 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2130207003, now seen corresponding path program 1 times [2019-12-18 21:18:50,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:50,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474087152] [2019-12-18 21:18:50,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:50,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474087152] [2019-12-18 21:18:50,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:50,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:18:50,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424961131] [2019-12-18 21:18:50,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:18:50,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:50,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:18:50,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:18:50,773 INFO L87 Difference]: Start difference. First operand 15629 states and 48434 transitions. Second operand 4 states. [2019-12-18 21:18:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:51,026 INFO L93 Difference]: Finished difference Result 19788 states and 60931 transitions. [2019-12-18 21:18:51,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:18:51,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:18:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:51,076 INFO L225 Difference]: With dead ends: 19788 [2019-12-18 21:18:51,076 INFO L226 Difference]: Without dead ends: 19788 [2019-12-18 21:18:51,078 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-18 21:18:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19788 states. [2019-12-18 21:18:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19788 to 16155. [2019-12-18 21:18:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16155 states. [2019-12-18 21:18:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16155 states to 16155 states and 50081 transitions. [2019-12-18 21:18:51,467 INFO L78 Accepts]: Start accepts. Automaton has 16155 states and 50081 transitions. Word has length 65 [2019-12-18 21:18:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:51,468 INFO L462 AbstractCegarLoop]: Abstraction has 16155 states and 50081 transitions. [2019-12-18 21:18:51,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:18:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 16155 states and 50081 transitions. [2019-12-18 21:18:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:18:51,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:51,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:51,485 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:51,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1667274217, now seen corresponding path program 2 times [2019-12-18 21:18:51,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:51,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909008766] [2019-12-18 21:18:51,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:51,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909008766] [2019-12-18 21:18:51,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:51,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:18:51,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244262511] [2019-12-18 21:18:51,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:18:51,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:18:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:18:51,528 INFO L87 Difference]: Start difference. First operand 16155 states and 50081 transitions. Second operand 4 states. [2019-12-18 21:18:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:51,803 INFO L93 Difference]: Finished difference Result 26296 states and 81367 transitions. [2019-12-18 21:18:51,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:18:51,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:18:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:51,842 INFO L225 Difference]: With dead ends: 26296 [2019-12-18 21:18:51,842 INFO L226 Difference]: Without dead ends: 26296 [2019-12-18 21:18:51,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26296 states. [2019-12-18 21:18:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26296 to 17196. [2019-12-18 21:18:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17196 states. [2019-12-18 21:18:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17196 states to 17196 states and 53644 transitions. [2019-12-18 21:18:52,176 INFO L78 Accepts]: Start accepts. Automaton has 17196 states and 53644 transitions. Word has length 65 [2019-12-18 21:18:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:52,177 INFO L462 AbstractCegarLoop]: Abstraction has 17196 states and 53644 transitions. [2019-12-18 21:18:52,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:18:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 17196 states and 53644 transitions. [2019-12-18 21:18:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:18:52,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:52,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:52,197 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1707397215, now seen corresponding path program 3 times [2019-12-18 21:18:52,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:52,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553013503] [2019-12-18 21:18:52,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:52,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553013503] [2019-12-18 21:18:52,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:52,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:18:52,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059087181] [2019-12-18 21:18:52,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:18:52,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:18:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:18:52,298 INFO L87 Difference]: Start difference. First operand 17196 states and 53644 transitions. Second operand 8 states. [2019-12-18 21:18:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:53,048 INFO L93 Difference]: Finished difference Result 34918 states and 106885 transitions. [2019-12-18 21:18:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:18:53,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 21:18:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:53,091 INFO L225 Difference]: With dead ends: 34918 [2019-12-18 21:18:53,092 INFO L226 Difference]: Without dead ends: 29270 [2019-12-18 21:18:53,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:18:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29270 states. [2019-12-18 21:18:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29270 to 17324. [2019-12-18 21:18:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17324 states. [2019-12-18 21:18:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17324 states to 17324 states and 53997 transitions. [2019-12-18 21:18:53,573 INFO L78 Accepts]: Start accepts. Automaton has 17324 states and 53997 transitions. Word has length 65 [2019-12-18 21:18:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:53,573 INFO L462 AbstractCegarLoop]: Abstraction has 17324 states and 53997 transitions. [2019-12-18 21:18:53,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:18:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 17324 states and 53997 transitions. [2019-12-18 21:18:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:18:53,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:53,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:53,593 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:53,593 INFO L82 PathProgramCache]: Analyzing trace with hash -405473777, now seen corresponding path program 4 times [2019-12-18 21:18:53,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:53,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029922632] [2019-12-18 21:18:53,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:53,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029922632] [2019-12-18 21:18:53,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:53,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:18:53,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876228555] [2019-12-18 21:18:53,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:18:53,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:18:53,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:18:53,717 INFO L87 Difference]: Start difference. First operand 17324 states and 53997 transitions. Second operand 9 states. [2019-12-18 21:18:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:54,901 INFO L93 Difference]: Finished difference Result 44301 states and 134374 transitions. [2019-12-18 21:18:54,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:18:54,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 21:18:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:54,951 INFO L225 Difference]: With dead ends: 44301 [2019-12-18 21:18:54,951 INFO L226 Difference]: Without dead ends: 36417 [2019-12-18 21:18:54,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:18:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36417 states. [2019-12-18 21:18:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36417 to 17750. [2019-12-18 21:18:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17750 states. [2019-12-18 21:18:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17750 states to 17750 states and 54571 transitions. [2019-12-18 21:18:55,360 INFO L78 Accepts]: Start accepts. Automaton has 17750 states and 54571 transitions. Word has length 65 [2019-12-18 21:18:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:55,360 INFO L462 AbstractCegarLoop]: Abstraction has 17750 states and 54571 transitions. [2019-12-18 21:18:55,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:18:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17750 states and 54571 transitions. [2019-12-18 21:18:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:18:55,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:55,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:55,389 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:55,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1990560429, now seen corresponding path program 5 times [2019-12-18 21:18:55,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:55,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829756297] [2019-12-18 21:18:55,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:55,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829756297] [2019-12-18 21:18:55,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:55,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:18:55,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374479915] [2019-12-18 21:18:55,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:18:55,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:55,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:18:55,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:18:55,498 INFO L87 Difference]: Start difference. First operand 17750 states and 54571 transitions. Second operand 9 states. [2019-12-18 21:18:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:56,528 INFO L93 Difference]: Finished difference Result 35275 states and 106215 transitions. [2019-12-18 21:18:56,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:18:56,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 21:18:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:56,573 INFO L225 Difference]: With dead ends: 35275 [2019-12-18 21:18:56,573 INFO L226 Difference]: Without dead ends: 31682 [2019-12-18 21:18:56,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:18:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31682 states. [2019-12-18 21:18:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31682 to 16887. [2019-12-18 21:18:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16887 states. [2019-12-18 21:18:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16887 states to 16887 states and 52277 transitions. [2019-12-18 21:18:56,934 INFO L78 Accepts]: Start accepts. Automaton has 16887 states and 52277 transitions. Word has length 65 [2019-12-18 21:18:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:56,934 INFO L462 AbstractCegarLoop]: Abstraction has 16887 states and 52277 transitions. [2019-12-18 21:18:56,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:18:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16887 states and 52277 transitions. [2019-12-18 21:18:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:18:56,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:56,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:56,954 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:56,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash -775345544, now seen corresponding path program 1 times [2019-12-18 21:18:56,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:56,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44088610] [2019-12-18 21:18:56,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:57,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44088610] [2019-12-18 21:18:57,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:57,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:18:57,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175179248] [2019-12-18 21:18:57,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:18:57,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:18:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:57,033 INFO L87 Difference]: Start difference. First operand 16887 states and 52277 transitions. Second operand 5 states. [2019-12-18 21:18:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:57,663 INFO L93 Difference]: Finished difference Result 24977 states and 75199 transitions. [2019-12-18 21:18:57,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:18:57,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 21:18:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:57,713 INFO L225 Difference]: With dead ends: 24977 [2019-12-18 21:18:57,713 INFO L226 Difference]: Without dead ends: 24757 [2019-12-18 21:18:57,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:18:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24757 states. [2019-12-18 21:18:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24757 to 20607. [2019-12-18 21:18:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20607 states. [2019-12-18 21:18:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20607 states to 20607 states and 63077 transitions. [2019-12-18 21:18:58,164 INFO L78 Accepts]: Start accepts. Automaton has 20607 states and 63077 transitions. Word has length 65 [2019-12-18 21:18:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:58,164 INFO L462 AbstractCegarLoop]: Abstraction has 20607 states and 63077 transitions. [2019-12-18 21:18:58,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:18:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 20607 states and 63077 transitions. [2019-12-18 21:18:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:18:58,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:58,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:58,189 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:58,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:58,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1459276134, now seen corresponding path program 2 times [2019-12-18 21:18:58,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:58,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509495804] [2019-12-18 21:18:58,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:58,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509495804] [2019-12-18 21:18:58,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:58,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:18:58,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944359321] [2019-12-18 21:18:58,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:58,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:58,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:58,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:58,242 INFO L87 Difference]: Start difference. First operand 20607 states and 63077 transitions. Second operand 3 states. [2019-12-18 21:18:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:58,320 INFO L93 Difference]: Finished difference Result 20607 states and 63076 transitions. [2019-12-18 21:18:58,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:58,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:18:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:58,350 INFO L225 Difference]: With dead ends: 20607 [2019-12-18 21:18:58,350 INFO L226 Difference]: Without dead ends: 20607 [2019-12-18 21:18:58,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20607 states. [2019-12-18 21:18:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20607 to 18812. [2019-12-18 21:18:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18812 states. [2019-12-18 21:18:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18812 states to 18812 states and 58059 transitions. [2019-12-18 21:18:58,657 INFO L78 Accepts]: Start accepts. Automaton has 18812 states and 58059 transitions. Word has length 65 [2019-12-18 21:18:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:58,657 INFO L462 AbstractCegarLoop]: Abstraction has 18812 states and 58059 transitions. [2019-12-18 21:18:58,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 18812 states and 58059 transitions. [2019-12-18 21:18:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:18:58,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:58,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:58,679 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:18:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1487759867, now seen corresponding path program 1 times [2019-12-18 21:18:58,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:58,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782374644] [2019-12-18 21:18:58,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:18:58,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782374644] [2019-12-18 21:18:58,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:58,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:18:58,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863776049] [2019-12-18 21:18:58,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:18:58,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:18:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:18:58,810 INFO L87 Difference]: Start difference. First operand 18812 states and 58059 transitions. Second operand 9 states. [2019-12-18 21:19:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:19:00,786 INFO L93 Difference]: Finished difference Result 33938 states and 102651 transitions. [2019-12-18 21:19:00,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:19:00,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 21:19:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:19:00,847 INFO L225 Difference]: With dead ends: 33938 [2019-12-18 21:19:00,847 INFO L226 Difference]: Without dead ends: 33938 [2019-12-18 21:19:00,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:19:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33938 states. [2019-12-18 21:19:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33938 to 18819. [2019-12-18 21:19:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18819 states. [2019-12-18 21:19:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18819 states to 18819 states and 58079 transitions. [2019-12-18 21:19:01,253 INFO L78 Accepts]: Start accepts. Automaton has 18819 states and 58079 transitions. Word has length 66 [2019-12-18 21:19:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:19:01,253 INFO L462 AbstractCegarLoop]: Abstraction has 18819 states and 58079 transitions. [2019-12-18 21:19:01,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:19:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 18819 states and 58079 transitions. [2019-12-18 21:19:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:19:01,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:19:01,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:19:01,275 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:19:01,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:19:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1214771677, now seen corresponding path program 2 times [2019-12-18 21:19:01,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:19:01,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173304307] [2019-12-18 21:19:01,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:19:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:19:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:19:01,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173304307] [2019-12-18 21:19:01,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:19:01,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:19:01,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056958385] [2019-12-18 21:19:01,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:19:01,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:19:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:19:01,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:19:01,328 INFO L87 Difference]: Start difference. First operand 18819 states and 58079 transitions. Second operand 3 states. [2019-12-18 21:19:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:19:01,375 INFO L93 Difference]: Finished difference Result 13413 states and 40936 transitions. [2019-12-18 21:19:01,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:19:01,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:19:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:19:01,394 INFO L225 Difference]: With dead ends: 13413 [2019-12-18 21:19:01,394 INFO L226 Difference]: Without dead ends: 13413 [2019-12-18 21:19:01,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:19:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13413 states. [2019-12-18 21:19:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13413 to 13144. [2019-12-18 21:19:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13144 states. [2019-12-18 21:19:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13144 states to 13144 states and 40179 transitions. [2019-12-18 21:19:01,725 INFO L78 Accepts]: Start accepts. Automaton has 13144 states and 40179 transitions. Word has length 66 [2019-12-18 21:19:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:19:01,725 INFO L462 AbstractCegarLoop]: Abstraction has 13144 states and 40179 transitions. [2019-12-18 21:19:01,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:19:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 13144 states and 40179 transitions. [2019-12-18 21:19:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:19:01,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:19:01,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:19:01,740 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:19:01,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:19:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-18 21:19:01,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:19:01,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419063918] [2019-12-18 21:19:01,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:19:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:19:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:19:01,864 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:19:01,864 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:19:01,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a$mem_tmp~0_9) (= 0 |v_ULTIMATE.start_main_~#t1001~0.offset_18|) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~a~0_26 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1001~0.base_23| 1) |v_#valid_63|) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1001~0.base_23|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1001~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1001~0.base_23|) |v_ULTIMATE.start_main_~#t1001~0.offset_18| 0))) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1001~0.base_23| 4)) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= 0 v_~y~0_7) (= v_~a$r_buff0_thd3~0_77 0) (= v_~a$flush_delayed~0_12 0) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1001~0.base_23|)) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= v_~x~0_19 0) (= 0 v_~a$w_buff1_used~0_76))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t1002~0.base=|v_ULTIMATE.start_main_~#t1002~0.base_21|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ULTIMATE.start_main_~#t1003~0.offset=|v_ULTIMATE.start_main_~#t1003~0.offset_16|, ~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_19, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ULTIMATE.start_main_~#t1003~0.base=|v_ULTIMATE.start_main_~#t1003~0.base_20|, ~y~0=v_~y~0_7, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_~#t1001~0.base=|v_ULTIMATE.start_main_~#t1001~0.base_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t1002~0.offset=|v_ULTIMATE.start_main_~#t1002~0.offset_15|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1001~0.offset=|v_ULTIMATE.start_main_~#t1001~0.offset_18|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t1002~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1003~0.offset, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1003~0.base, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1001~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1002~0.offset, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1001~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 21:19:01,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1002~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1002~0.base_9|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1002~0.base_9| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1002~0.base_9|) (= |v_ULTIMATE.start_main_~#t1002~0.offset_7| 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1002~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1002~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1002~0.base_9|) |v_ULTIMATE.start_main_~#t1002~0.offset_7| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1002~0.offset=|v_ULTIMATE.start_main_~#t1002~0.offset_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1002~0.base=|v_ULTIMATE.start_main_~#t1002~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1002~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1002~0.base] because there is no mapped edge [2019-12-18 21:19:01,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1003~0.base_9| 1) |v_#valid_32|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1003~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1003~0.base_9| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1003~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1003~0.base_9|) |v_ULTIMATE.start_main_~#t1003~0.offset_8| 2)) |v_#memory_int_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1003~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1003~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1003~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1003~0.offset=|v_ULTIMATE.start_main_~#t1003~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1003~0.base=|v_ULTIMATE.start_main_~#t1003~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1003~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1003~0.base, #length] because there is no mapped edge [2019-12-18 21:19:01,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~a$r_buff0_thd1~0_In-1287373325 ~a$r_buff1_thd1~0_Out-1287373325) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1287373325)) (= 1 ~x~0_Out-1287373325) (= ~a$r_buff0_thd3~0_In-1287373325 ~a$r_buff1_thd3~0_Out-1287373325) (= ~a$r_buff0_thd0~0_In-1287373325 ~a$r_buff1_thd0~0_Out-1287373325) (= 1 ~a$r_buff0_thd1~0_Out-1287373325) (= ~a$r_buff1_thd2~0_Out-1287373325 ~a$r_buff0_thd2~0_In-1287373325)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1287373325, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1287373325, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1287373325, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1287373325, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1287373325} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1287373325, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1287373325, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1287373325, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1287373325, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1287373325, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1287373325, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1287373325, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1287373325, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1287373325, ~x~0=~x~0_Out-1287373325} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 21:19:01,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-2045025812 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-2045025812 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-2045025812| |P1Thread1of1ForFork2_#t~ite9_Out-2045025812|))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-2045025812| ~a~0_In-2045025812) (or .cse1 .cse2)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-2045025812| ~a$w_buff1~0_In-2045025812) (not .cse2) .cse0))) InVars {~a~0=~a~0_In-2045025812, ~a$w_buff1~0=~a$w_buff1~0_In-2045025812, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2045025812, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2045025812} OutVars{~a~0=~a~0_In-2045025812, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2045025812|, ~a$w_buff1~0=~a$w_buff1~0_In-2045025812, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2045025812, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-2045025812|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2045025812} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 21:19:01,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In311180438 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out311180438| ~a$w_buff0~0_In311180438) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out311180438| |P2Thread1of1ForFork0_#t~ite20_Out311180438|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In311180438 256)))) (or (= (mod ~a$w_buff0_used~0_In311180438 256) 0) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In311180438 256))) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In311180438 256) 0))))) (and (= |P2Thread1of1ForFork0_#t~ite21_Out311180438| ~a$w_buff0~0_In311180438) (= |P2Thread1of1ForFork0_#t~ite20_In311180438| |P2Thread1of1ForFork0_#t~ite20_Out311180438|) (not .cse0)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In311180438, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In311180438, ~a$w_buff0_used~0=~a$w_buff0_used~0_In311180438, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In311180438, ~a$w_buff1_used~0=~a$w_buff1_used~0_In311180438, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In311180438|, ~weak$$choice2~0=~weak$$choice2~0_In311180438} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out311180438|, ~a$w_buff0~0=~a$w_buff0~0_In311180438, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In311180438, ~a$w_buff0_used~0=~a$w_buff0_used~0_In311180438, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In311180438, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out311180438|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In311180438, ~weak$$choice2~0=~weak$$choice2~0_In311180438} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 21:19:01,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-281995348 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-281995348 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-281995348| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-281995348| ~a$w_buff0_used~0_In-281995348)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-281995348, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-281995348} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-281995348, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-281995348, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-281995348|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 21:19:01,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-552900343 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-552900343 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-552900343 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-552900343 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-552900343|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-552900343 |P1Thread1of1ForFork2_#t~ite12_Out-552900343|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-552900343, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-552900343, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-552900343, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-552900343} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-552900343, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-552900343, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-552900343, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-552900343|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-552900343} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 21:19:01,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1958350040 256)))) (or (and (= ~a$w_buff1~0_In1958350040 |P2Thread1of1ForFork0_#t~ite24_Out1958350040|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In1958350040| |P2Thread1of1ForFork0_#t~ite23_Out1958350040|)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1958350040 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In1958350040 256)) .cse1) (= (mod ~a$w_buff0_used~0_In1958350040 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1958350040 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out1958350040| |P2Thread1of1ForFork0_#t~ite24_Out1958350040|) (= |P2Thread1of1ForFork0_#t~ite23_Out1958350040| ~a$w_buff1~0_In1958350040)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1958350040, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1958350040|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1958350040, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1958350040, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1958350040, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1958350040, ~weak$$choice2~0=~weak$$choice2~0_In1958350040} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1958350040, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1958350040|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1958350040|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1958350040, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1958350040, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1958350040, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1958350040, ~weak$$choice2~0=~weak$$choice2~0_In1958350040} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 21:19:01,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In515533473 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In515533473| |P2Thread1of1ForFork0_#t~ite26_Out515533473|) (not .cse0) (= ~a$w_buff0_used~0_In515533473 |P2Thread1of1ForFork0_#t~ite27_Out515533473|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In515533473 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In515533473 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In515533473 256)) .cse1) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In515533473 256))))) (= ~a$w_buff0_used~0_In515533473 |P2Thread1of1ForFork0_#t~ite26_Out515533473|) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out515533473| |P2Thread1of1ForFork0_#t~ite26_Out515533473|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In515533473|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In515533473, ~a$w_buff0_used~0=~a$w_buff0_used~0_In515533473, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In515533473, ~a$w_buff1_used~0=~a$w_buff1_used~0_In515533473, ~weak$$choice2~0=~weak$$choice2~0_In515533473} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out515533473|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out515533473|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In515533473, ~a$w_buff0_used~0=~a$w_buff0_used~0_In515533473, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In515533473, ~a$w_buff1_used~0=~a$w_buff1_used~0_In515533473, ~weak$$choice2~0=~weak$$choice2~0_In515533473} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 21:19:01,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1470709470 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1470709470 256)))) (or (and (= ~a$r_buff0_thd2~0_In1470709470 |P1Thread1of1ForFork2_#t~ite13_Out1470709470|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1470709470|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1470709470, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1470709470} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1470709470, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1470709470, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1470709470|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 21:19:01,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-289989596 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-289989596 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-289989596 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-289989596 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-289989596| ~a$r_buff1_thd2~0_In-289989596) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-289989596| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-289989596, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-289989596, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-289989596, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-289989596} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-289989596, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-289989596, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-289989596, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-289989596, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-289989596|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 21:19:01,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:19:01,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 21:19:01,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 21:19:01,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-798110065 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-798110065 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-798110065| ~a~0_In-798110065) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-798110065 |P2Thread1of1ForFork0_#t~ite38_Out-798110065|)))) InVars {~a~0=~a~0_In-798110065, ~a$w_buff1~0=~a$w_buff1~0_In-798110065, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-798110065, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-798110065} OutVars{~a~0=~a~0_In-798110065, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-798110065|, ~a$w_buff1~0=~a$w_buff1~0_In-798110065, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-798110065, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-798110065} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:19:01,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:19:01,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1688668307 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1688668307 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1688668307 |P2Thread1of1ForFork0_#t~ite40_Out-1688668307|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1688668307|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1688668307, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1688668307} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1688668307|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1688668307, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1688668307} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 21:19:01,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1064895512 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1064895512 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1064895512 |P0Thread1of1ForFork1_#t~ite5_Out1064895512|)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1064895512| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1064895512, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1064895512} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1064895512|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1064895512, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1064895512} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 21:19:01,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-624593789 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-624593789 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-624593789 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-624593789 256) 0))) (or (and (= ~a$w_buff1_used~0_In-624593789 |P0Thread1of1ForFork1_#t~ite6_Out-624593789|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out-624593789| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-624593789, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-624593789, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-624593789, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-624593789} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-624593789|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-624593789, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-624593789, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-624593789, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-624593789} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 21:19:01,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In276419899 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In276419899 256) 0))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out276419899) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out276419899 ~a$r_buff0_thd1~0_In276419899)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In276419899, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In276419899} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out276419899|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In276419899, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out276419899} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:19:01,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In494987257 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In494987257 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In494987257 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In494987257 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out494987257|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$r_buff1_thd1~0_In494987257 |P0Thread1of1ForFork1_#t~ite8_Out494987257|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In494987257, ~a$w_buff0_used~0=~a$w_buff0_used~0_In494987257, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In494987257, ~a$w_buff1_used~0=~a$w_buff1_used~0_In494987257} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out494987257|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In494987257, ~a$w_buff0_used~0=~a$w_buff0_used~0_In494987257, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In494987257, ~a$w_buff1_used~0=~a$w_buff1_used~0_In494987257} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:19:01,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:19:01,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1199218390 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1199218390 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1199218390 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-1199218390 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1199218390| ~a$w_buff1_used~0_In-1199218390) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1199218390| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1199218390, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1199218390, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1199218390, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1199218390} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1199218390, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1199218390, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1199218390, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1199218390, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1199218390|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 21:19:01,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1152592293 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1152592293 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1152592293| ~a$r_buff0_thd3~0_In1152592293)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1152592293|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1152592293, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1152592293} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1152592293, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1152592293, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1152592293|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 21:19:01,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In2072860117 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In2072860117 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2072860117 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2072860117 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In2072860117 |P2Thread1of1ForFork0_#t~ite43_Out2072860117|)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out2072860117| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2072860117, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2072860117, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2072860117, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2072860117} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2072860117|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2072860117, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2072860117, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2072860117, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2072860117} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 21:19:01,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:19:01,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:19:01,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-105384258| |ULTIMATE.start_main_#t~ite48_Out-105384258|)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-105384258 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-105384258 256) 0))) (or (and (= ~a$w_buff1~0_In-105384258 |ULTIMATE.start_main_#t~ite47_Out-105384258|) (not .cse0) (not .cse1) .cse2) (and .cse2 (or .cse1 .cse0) (= ~a~0_In-105384258 |ULTIMATE.start_main_#t~ite47_Out-105384258|)))) InVars {~a~0=~a~0_In-105384258, ~a$w_buff1~0=~a$w_buff1~0_In-105384258, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-105384258, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-105384258} OutVars{~a~0=~a~0_In-105384258, ~a$w_buff1~0=~a$w_buff1~0_In-105384258, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-105384258|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-105384258, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-105384258|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-105384258} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:19:01,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1670437279 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1670437279 256)))) (or (and (= ~a$w_buff0_used~0_In-1670437279 |ULTIMATE.start_main_#t~ite49_Out-1670437279|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1670437279|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1670437279, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1670437279} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1670437279, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1670437279|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1670437279} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:19:01,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1832938640 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1832938640 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In1832938640 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1832938640 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1832938640 |ULTIMATE.start_main_#t~ite50_Out1832938640|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1832938640| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1832938640, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1832938640, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1832938640, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1832938640} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1832938640|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1832938640, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1832938640, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1832938640, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1832938640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:19:01,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-225449995 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-225449995 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-225449995|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-225449995 |ULTIMATE.start_main_#t~ite51_Out-225449995|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-225449995, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-225449995} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-225449995|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-225449995, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-225449995} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:19:01,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In958349020 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In958349020 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In958349020 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In958349020 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out958349020|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In958349020 |ULTIMATE.start_main_#t~ite52_Out958349020|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In958349020, ~a$w_buff0_used~0=~a$w_buff0_used~0_In958349020, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In958349020, ~a$w_buff1_used~0=~a$w_buff1_used~0_In958349020} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out958349020|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In958349020, ~a$w_buff0_used~0=~a$w_buff0_used~0_In958349020, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In958349020, ~a$w_buff1_used~0=~a$w_buff1_used~0_In958349020} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:19:01,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~x~0_13 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p1_EAX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:19:01,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:19:01 BasicIcfg [2019-12-18 21:19:01,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:19:01,986 INFO L168 Benchmark]: Toolchain (without parser) took 99567.98 ms. Allocated memory was 146.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:19:01,986 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:19:01,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.99 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 157.3 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:19:01,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.72 ms. Allocated memory is still 204.5 MB. Free memory was 157.3 MB in the beginning and 155.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:19:01,987 INFO L168 Benchmark]: Boogie Preprocessor took 60.85 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:19:01,988 INFO L168 Benchmark]: RCFGBuilder took 907.17 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 101.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:19:01,988 INFO L168 Benchmark]: TraceAbstraction took 97683.49 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:19:01,990 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 is still 120.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 836.99 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 157.3 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.72 ms. Allocated memory is still 204.5 MB. Free memory was 157.3 MB in the beginning and 155.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.85 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 907.17 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 101.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97683.49 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 97.3s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 36.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8299 SDtfs, 12363 SDslu, 21548 SDs, 0 SdLazy, 14525 SolverSat, 684 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 84 SyntacticMatches, 16 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 347974 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1725 NumberOfCodeBlocks, 1725 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1621 ConstructedInterpolants, 0 QuantifiedInterpolants, 275905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...