/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/mix049_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:38:47,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:38:47,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:38:47,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:38:47,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:38:47,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:38:47,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:38:47,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:38:47,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:38:47,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:38:47,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:38:47,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:38:47,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:38:47,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:38:47,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:38:47,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:38:47,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:38:47,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:38:47,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:38:47,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:38:47,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:38:47,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:38:47,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:38:47,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:38:47,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:38:47,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:38:47,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:38:47,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:38:47,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:38:47,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:38:47,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:38:47,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:38:47,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:38:47,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:38:47,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:38:47,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:38:47,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:38:47,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:38:47,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:38:47,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:38:47,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:38:47,171 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:38:47,195 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:38:47,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:38:47,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:38:47,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:38:47,198 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:38:47,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:38:47,198 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:38:47,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:38:47,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:38:47,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:38:47,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:38:47,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:38:47,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:38:47,201 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:38:47,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:38:47,201 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:38:47,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:38:47,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:38:47,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:38:47,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:38:47,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:38:47,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:38:47,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:38:47,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:38:47,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:38:47,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:38:47,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:38:47,203 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:38:47,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:38:47,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:38:47,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:38:47,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:38:47,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:38:47,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:38:47,517 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:38:47,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.opt.i [2019-12-18 21:38:47,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f2e40095/e82401bf4b524ede84448051dadb2fd3/FLAGddccc5727 [2019-12-18 21:38:48,131 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:38:48,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_tso.opt.i [2019-12-18 21:38:48,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f2e40095/e82401bf4b524ede84448051dadb2fd3/FLAGddccc5727 [2019-12-18 21:38:48,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f2e40095/e82401bf4b524ede84448051dadb2fd3 [2019-12-18 21:38:48,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:38:48,414 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:38:48,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:38:48,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:38:48,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:38:48,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:48" (1/1) ... [2019-12-18 21:38:48,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d61e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:48, skipping insertion in model container [2019-12-18 21:38:48,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:48" (1/1) ... [2019-12-18 21:38:48,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:38:48,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:38:49,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:38:49,080 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:38:49,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:38:49,264 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:38:49,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49 WrapperNode [2019-12-18 21:38:49,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:38:49,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:38:49,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:38:49,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:38:49,276 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:38:49" (1/1) ... [2019-12-18 21:38:49,301 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:38:49" (1/1) ... [2019-12-18 21:38:49,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:38:49,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:38:49,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:38:49,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:38:49,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49" (1/1) ... [2019-12-18 21:38:49,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49" (1/1) ... [2019-12-18 21:38:49,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49" (1/1) ... [2019-12-18 21:38:49,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49" (1/1) ... [2019-12-18 21:38:49,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49" (1/1) ... [2019-12-18 21:38:49,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49" (1/1) ... [2019-12-18 21:38:49,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49" (1/1) ... [2019-12-18 21:38:49,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:38:49,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:38:49,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:38:49,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:38:49,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49" (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:38:49,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:38:49,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:38:49,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:38:49,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:38:49,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:38:49,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:38:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:38:49,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:38:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:38:49,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:38:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:38:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:38:49,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:38:49,457 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:38:50,241 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:38:50,241 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:38:50,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:50 BoogieIcfgContainer [2019-12-18 21:38:50,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:38:50,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:38:50,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:38:50,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:38:50,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:38:48" (1/3) ... [2019-12-18 21:38:50,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649da01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:50, skipping insertion in model container [2019-12-18 21:38:50,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:49" (2/3) ... [2019-12-18 21:38:50,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649da01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:50, skipping insertion in model container [2019-12-18 21:38:50,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:50" (3/3) ... [2019-12-18 21:38:50,252 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_tso.opt.i [2019-12-18 21:38:50,263 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:38:50,263 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:38:50,272 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:38:50,273 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:38:50,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,317 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,317 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,317 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,318 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,318 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,378 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,380 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,389 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,391 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,391 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:50,407 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:38:50,428 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:38:50,428 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:38:50,428 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:38:50,429 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:38:50,429 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:38:50,429 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:38:50,429 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:38:50,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:38:50,446 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 21:38:50,448 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:38:50,537 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:38:50,537 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:38:50,559 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:38:50,588 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:38:50,654 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:38:50,654 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:38:50,665 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:38:50,689 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:38:50,690 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:38:54,022 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 21:38:54,185 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:38:54,211 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-18 21:38:54,211 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 21:38:54,215 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-18 21:39:17,452 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-18 21:39:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-18 21:39:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:39:17,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:17,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:39:17,462 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:39:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-18 21:39:17,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:17,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188214900] [2019-12-18 21:39:17,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:17,698 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:39:17,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188214900] [2019-12-18 21:39:17,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:17,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:39:17,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159665949] [2019-12-18 21:39:17,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:17,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:17,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:17,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:17,730 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-18 21:39:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:20,502 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-18 21:39:20,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:20,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:39:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:21,201 INFO L225 Difference]: With dead ends: 120110 [2019-12-18 21:39:21,201 INFO L226 Difference]: Without dead ends: 112648 [2019-12-18 21:39:21,203 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:39:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-18 21:39:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-18 21:39:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-18 21:39:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-18 21:39:31,160 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-18 21:39:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:31,160 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-18 21:39:31,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-18 21:39:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:39:31,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:31,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:31,165 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:39:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:31,166 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-18 21:39:31,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:31,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853948232] [2019-12-18 21:39:31,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:31,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853948232] [2019-12-18 21:39:31,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:31,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:39:31,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083975837] [2019-12-18 21:39:31,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:39:31,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:39:31,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:39:31,275 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-18 21:39:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:36,274 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-18 21:39:36,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:39:36,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:39:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:36,877 INFO L225 Difference]: With dead ends: 175220 [2019-12-18 21:39:36,878 INFO L226 Difference]: Without dead ends: 175171 [2019-12-18 21:39:36,878 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:39:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-18 21:39:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-18 21:39:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-18 21:39:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-18 21:39:51,808 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-18 21:39:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:51,809 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-18 21:39:51,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:39:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-18 21:39:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:39:51,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:51,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:51,815 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:39:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-18 21:39:51,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:51,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923031218] [2019-12-18 21:39:51,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:51,871 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:39:51,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923031218] [2019-12-18 21:39:51,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:51,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:39:51,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735381823] [2019-12-18 21:39:51,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:51,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:51,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:51,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:51,873 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-18 21:39:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:52,014 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-18 21:39:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:52,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:39:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:52,073 INFO L225 Difference]: With dead ends: 34935 [2019-12-18 21:39:52,074 INFO L226 Difference]: Without dead ends: 34935 [2019-12-18 21:39:52,074 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:39:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-18 21:39:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-18 21:39:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-18 21:39:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-18 21:39:52,736 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-18 21:39:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:52,737 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-18 21:39:52,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-18 21:39:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:39:52,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:52,740 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:39:52,740 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:39:52,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-18 21:39:52,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:52,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2824088] [2019-12-18 21:39:52,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:52,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:39:52,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2824088] [2019-12-18 21:39:52,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:52,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:39:52,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792435406] [2019-12-18 21:39:52,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:52,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:52,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:52,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:52,823 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-18 21:39:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:54,138 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-18 21:39:54,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:54,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:39:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:54,231 INFO L225 Difference]: With dead ends: 52469 [2019-12-18 21:39:54,231 INFO L226 Difference]: Without dead ends: 52469 [2019-12-18 21:39:54,231 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:39:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-18 21:39:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-18 21:39:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-18 21:39:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-18 21:39:55,014 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-18 21:39:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:55,015 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-18 21:39:55,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-18 21:39:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:39:55,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:55,019 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:39:55,020 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:39:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-18 21:39:55,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:55,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054500356] [2019-12-18 21:39:55,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:55,153 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:39:55,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054500356] [2019-12-18 21:39:55,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:55,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:39:55,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215142240] [2019-12-18 21:39:55,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:39:55,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:55,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:39:55,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:39:55,156 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-18 21:39:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:55,666 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-18 21:39:55,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:39:55,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 21:39:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:55,758 INFO L225 Difference]: With dead ends: 54128 [2019-12-18 21:39:55,759 INFO L226 Difference]: Without dead ends: 54128 [2019-12-18 21:39:55,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:39:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-18 21:39:57,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-18 21:39:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-18 21:39:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-18 21:39:57,679 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-18 21:39:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:57,679 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-18 21:39:57,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:39:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-18 21:39:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:39:57,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:57,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:57,693 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:39:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-18 21:39:57,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:57,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38314407] [2019-12-18 21:39:57,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:57,796 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:39:57,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38314407] [2019-12-18 21:39:57,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:57,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:39:57,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306286529] [2019-12-18 21:39:57,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:39:57,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:39:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:39:57,799 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 6 states. [2019-12-18 21:39:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:58,806 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-18 21:39:58,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:39:58,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:39:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:58,920 INFO L225 Difference]: With dead ends: 67629 [2019-12-18 21:39:58,920 INFO L226 Difference]: Without dead ends: 67622 [2019-12-18 21:39:58,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:39:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-18 21:40:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-18 21:40:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-18 21:40:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-18 21:40:02,549 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-18 21:40:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:02,549 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-18 21:40:02,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:40:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-18 21:40:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:40:02,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:02,567 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:40:02,567 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:40:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-18 21:40:02,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:02,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535029594] [2019-12-18 21:40:02,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:02,627 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:40:02,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535029594] [2019-12-18 21:40:02,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:02,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:40:02,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073337762] [2019-12-18 21:40:02,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:40:02,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:40:02,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:40:02,629 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 4 states. [2019-12-18 21:40:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:02,713 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-18 21:40:02,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:40:02,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:40:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:02,739 INFO L225 Difference]: With dead ends: 18428 [2019-12-18 21:40:02,740 INFO L226 Difference]: Without dead ends: 18428 [2019-12-18 21:40:02,740 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:40:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-18 21:40:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-18 21:40:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-18 21:40:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-18 21:40:03,043 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-18 21:40:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:03,043 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-18 21:40:03,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:40:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-18 21:40:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:40:03,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:03,063 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:40:03,063 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:40:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:03,064 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-18 21:40:03,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:03,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128775819] [2019-12-18 21:40:03,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:03,168 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:40:03,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128775819] [2019-12-18 21:40:03,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:03,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:40:03,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191144754] [2019-12-18 21:40:03,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:40:03,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:40:03,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:40:03,171 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-18 21:40:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:03,793 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-18 21:40:03,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:40:03,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:40:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:03,831 INFO L225 Difference]: With dead ends: 25507 [2019-12-18 21:40:03,831 INFO L226 Difference]: Without dead ends: 25507 [2019-12-18 21:40:03,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:40:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-18 21:40:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-18 21:40:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-18 21:40:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-18 21:40:04,541 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-18 21:40:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:04,541 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-18 21:40:04,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:40:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-18 21:40:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:40:04,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:04,565 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:40:04,565 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:40:04,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:04,565 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-18 21:40:04,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:04,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171610173] [2019-12-18 21:40:04,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:40:04,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171610173] [2019-12-18 21:40:04,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:04,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:40:04,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095023835] [2019-12-18 21:40:04,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:40:04,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:40:04,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:40:04,663 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 7 states. [2019-12-18 21:40:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:06,000 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-18 21:40:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:40:06,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:40:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:06,041 INFO L225 Difference]: With dead ends: 28486 [2019-12-18 21:40:06,042 INFO L226 Difference]: Without dead ends: 28486 [2019-12-18 21:40:06,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:40:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-18 21:40:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-18 21:40:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-18 21:40:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-18 21:40:06,415 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-18 21:40:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:06,416 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-18 21:40:06,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:40:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-18 21:40:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:40:06,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:06,442 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:40:06,443 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:40:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-18 21:40:06,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:06,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190235658] [2019-12-18 21:40:06,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:06,517 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:40:06,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190235658] [2019-12-18 21:40:06,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:06,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:40:06,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413259809] [2019-12-18 21:40:06,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:40:06,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:06,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:40:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:40:06,519 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 5 states. [2019-12-18 21:40:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:07,115 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-18 21:40:07,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:40:07,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:40:07,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:07,157 INFO L225 Difference]: With dead ends: 28283 [2019-12-18 21:40:07,157 INFO L226 Difference]: Without dead ends: 28283 [2019-12-18 21:40:07,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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:40:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-18 21:40:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-18 21:40:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-18 21:40:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-18 21:40:07,881 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-18 21:40:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:07,881 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-18 21:40:07,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:40:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-18 21:40:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:40:07,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:07,911 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:40:07,912 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:40:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-18 21:40:07,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:07,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811801458] [2019-12-18 21:40:07,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:08,011 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:40:08,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811801458] [2019-12-18 21:40:08,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:08,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:40:08,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438129113] [2019-12-18 21:40:08,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:40:08,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:08,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:40:08,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:40:08,014 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 3 states. [2019-12-18 21:40:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:08,149 INFO L93 Difference]: Finished difference Result 26386 states and 81161 transitions. [2019-12-18 21:40:08,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:40:08,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 21:40:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:08,210 INFO L225 Difference]: With dead ends: 26386 [2019-12-18 21:40:08,210 INFO L226 Difference]: Without dead ends: 26386 [2019-12-18 21:40:08,210 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:40:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26386 states. [2019-12-18 21:40:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26386 to 22631. [2019-12-18 21:40:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22631 states. [2019-12-18 21:40:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22631 states to 22631 states and 70743 transitions. [2019-12-18 21:40:08,732 INFO L78 Accepts]: Start accepts. Automaton has 22631 states and 70743 transitions. Word has length 39 [2019-12-18 21:40:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:08,733 INFO L462 AbstractCegarLoop]: Abstraction has 22631 states and 70743 transitions. [2019-12-18 21:40:08,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:40:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 22631 states and 70743 transitions. [2019-12-18 21:40:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:40:08,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:08,755 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:40:08,755 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:40:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1172451276, now seen corresponding path program 1 times [2019-12-18 21:40:08,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:08,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391031311] [2019-12-18 21:40:08,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:08,832 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:40:08,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391031311] [2019-12-18 21:40:08,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:08,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:40:08,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074882333] [2019-12-18 21:40:08,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:40:08,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:08,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:40:08,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:40:08,835 INFO L87 Difference]: Start difference. First operand 22631 states and 70743 transitions. Second operand 5 states. [2019-12-18 21:40:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:08,943 INFO L93 Difference]: Finished difference Result 21311 states and 67738 transitions. [2019-12-18 21:40:08,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:40:08,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:40:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:08,985 INFO L225 Difference]: With dead ends: 21311 [2019-12-18 21:40:08,986 INFO L226 Difference]: Without dead ends: 21311 [2019-12-18 21:40:08,986 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:40:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21311 states. [2019-12-18 21:40:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21311 to 21311. [2019-12-18 21:40:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21311 states. [2019-12-18 21:40:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21311 states to 21311 states and 67738 transitions. [2019-12-18 21:40:09,372 INFO L78 Accepts]: Start accepts. Automaton has 21311 states and 67738 transitions. Word has length 40 [2019-12-18 21:40:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:09,372 INFO L462 AbstractCegarLoop]: Abstraction has 21311 states and 67738 transitions. [2019-12-18 21:40:09,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:40:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 21311 states and 67738 transitions. [2019-12-18 21:40:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:40:09,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:09,582 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:40:09,582 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:40:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash 236633210, now seen corresponding path program 1 times [2019-12-18 21:40:09,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:09,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921076723] [2019-12-18 21:40:09,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:09,709 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:40:09,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921076723] [2019-12-18 21:40:09,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:09,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:40:09,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443354328] [2019-12-18 21:40:09,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:40:09,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:09,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:40:09,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:40:09,712 INFO L87 Difference]: Start difference. First operand 21311 states and 67738 transitions. Second operand 7 states. [2019-12-18 21:40:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:10,210 INFO L93 Difference]: Finished difference Result 58693 states and 186497 transitions. [2019-12-18 21:40:10,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:40:10,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:40:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:10,280 INFO L225 Difference]: With dead ends: 58693 [2019-12-18 21:40:10,280 INFO L226 Difference]: Without dead ends: 45552 [2019-12-18 21:40:10,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:40:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45552 states. [2019-12-18 21:40:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45552 to 24967. [2019-12-18 21:40:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24967 states. [2019-12-18 21:40:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24967 states to 24967 states and 79925 transitions. [2019-12-18 21:40:10,874 INFO L78 Accepts]: Start accepts. Automaton has 24967 states and 79925 transitions. Word has length 65 [2019-12-18 21:40:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:10,874 INFO L462 AbstractCegarLoop]: Abstraction has 24967 states and 79925 transitions. [2019-12-18 21:40:10,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:40:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 24967 states and 79925 transitions. [2019-12-18 21:40:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:40:10,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:10,914 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:40:10,915 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:40:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash 896785052, now seen corresponding path program 2 times [2019-12-18 21:40:10,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:10,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419826442] [2019-12-18 21:40:10,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:11,006 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:40:11,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419826442] [2019-12-18 21:40:11,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:11,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:40:11,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580873367] [2019-12-18 21:40:11,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:40:11,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:11,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:40:11,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:40:11,008 INFO L87 Difference]: Start difference. First operand 24967 states and 79925 transitions. Second operand 7 states. [2019-12-18 21:40:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:11,701 INFO L93 Difference]: Finished difference Result 66722 states and 210684 transitions. [2019-12-18 21:40:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:40:11,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:40:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:11,785 INFO L225 Difference]: With dead ends: 66722 [2019-12-18 21:40:11,785 INFO L226 Difference]: Without dead ends: 47701 [2019-12-18 21:40:11,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:40:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47701 states. [2019-12-18 21:40:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47701 to 29639. [2019-12-18 21:40:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29639 states. [2019-12-18 21:40:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29639 states to 29639 states and 94665 transitions. [2019-12-18 21:40:12,647 INFO L78 Accepts]: Start accepts. Automaton has 29639 states and 94665 transitions. Word has length 65 [2019-12-18 21:40:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:12,647 INFO L462 AbstractCegarLoop]: Abstraction has 29639 states and 94665 transitions. [2019-12-18 21:40:12,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:40:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 29639 states and 94665 transitions. [2019-12-18 21:40:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:40:12,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:12,683 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:40:12,684 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:40:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1620990666, now seen corresponding path program 3 times [2019-12-18 21:40:12,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:12,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200816530] [2019-12-18 21:40:12,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:12,778 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:40:12,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200816530] [2019-12-18 21:40:12,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:12,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:40:12,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917500901] [2019-12-18 21:40:12,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:40:12,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:12,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:40:12,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:40:12,780 INFO L87 Difference]: Start difference. First operand 29639 states and 94665 transitions. Second operand 7 states. [2019-12-18 21:40:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:13,223 INFO L93 Difference]: Finished difference Result 58438 states and 184588 transitions. [2019-12-18 21:40:13,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:40:13,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:40:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:13,317 INFO L225 Difference]: With dead ends: 58438 [2019-12-18 21:40:13,317 INFO L226 Difference]: Without dead ends: 51671 [2019-12-18 21:40:13,318 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:40:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51671 states. [2019-12-18 21:40:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51671 to 29947. [2019-12-18 21:40:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29947 states. [2019-12-18 21:40:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29947 states to 29947 states and 95616 transitions. [2019-12-18 21:40:14,006 INFO L78 Accepts]: Start accepts. Automaton has 29947 states and 95616 transitions. Word has length 65 [2019-12-18 21:40:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:14,006 INFO L462 AbstractCegarLoop]: Abstraction has 29947 states and 95616 transitions. [2019-12-18 21:40:14,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:40:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 29947 states and 95616 transitions. [2019-12-18 21:40:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:40:14,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:14,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:40:14,041 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:40:14,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash 691532486, now seen corresponding path program 4 times [2019-12-18 21:40:14,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:14,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076193018] [2019-12-18 21:40:14,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:14,108 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:40:14,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076193018] [2019-12-18 21:40:14,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:14,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:40:14,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040161255] [2019-12-18 21:40:14,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:40:14,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:40:14,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:40:14,110 INFO L87 Difference]: Start difference. First operand 29947 states and 95616 transitions. Second operand 3 states. [2019-12-18 21:40:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:14,465 INFO L93 Difference]: Finished difference Result 34953 states and 110763 transitions. [2019-12-18 21:40:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:40:14,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:40:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:14,513 INFO L225 Difference]: With dead ends: 34953 [2019-12-18 21:40:14,513 INFO L226 Difference]: Without dead ends: 34953 [2019-12-18 21:40:14,514 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:40:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34953 states. [2019-12-18 21:40:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34953 to 30783. [2019-12-18 21:40:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30783 states. [2019-12-18 21:40:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30783 states to 30783 states and 98542 transitions. [2019-12-18 21:40:15,035 INFO L78 Accepts]: Start accepts. Automaton has 30783 states and 98542 transitions. Word has length 65 [2019-12-18 21:40:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:15,035 INFO L462 AbstractCegarLoop]: Abstraction has 30783 states and 98542 transitions. [2019-12-18 21:40:15,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:40:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 30783 states and 98542 transitions. [2019-12-18 21:40:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:40:15,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:15,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:40:15,073 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:40:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash 868435461, now seen corresponding path program 1 times [2019-12-18 21:40:15,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:15,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233407760] [2019-12-18 21:40:15,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:15,126 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:40:15,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233407760] [2019-12-18 21:40:15,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:15,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:40:15,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704003859] [2019-12-18 21:40:15,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:40:15,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:15,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:40:15,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:40:15,129 INFO L87 Difference]: Start difference. First operand 30783 states and 98542 transitions. Second operand 4 states. [2019-12-18 21:40:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:15,712 INFO L93 Difference]: Finished difference Result 47971 states and 153431 transitions. [2019-12-18 21:40:15,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:40:15,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 21:40:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:15,842 INFO L225 Difference]: With dead ends: 47971 [2019-12-18 21:40:15,842 INFO L226 Difference]: Without dead ends: 47971 [2019-12-18 21:40:15,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:40:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47971 states. [2019-12-18 21:40:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47971 to 34031. [2019-12-18 21:40:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34031 states. [2019-12-18 21:40:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34031 states to 34031 states and 110032 transitions. [2019-12-18 21:40:16,697 INFO L78 Accepts]: Start accepts. Automaton has 34031 states and 110032 transitions. Word has length 66 [2019-12-18 21:40:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:16,697 INFO L462 AbstractCegarLoop]: Abstraction has 34031 states and 110032 transitions. [2019-12-18 21:40:16,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:40:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 34031 states and 110032 transitions. [2019-12-18 21:40:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:40:16,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:16,737 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:40:16,737 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:40:16,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:16,738 INFO L82 PathProgramCache]: Analyzing trace with hash -909174781, now seen corresponding path program 2 times [2019-12-18 21:40:16,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:16,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136853930] [2019-12-18 21:40:16,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:16,783 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:40:16,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136853930] [2019-12-18 21:40:16,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:16,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:40:16,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049887606] [2019-12-18 21:40:16,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:40:16,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:16,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:40:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:40:16,788 INFO L87 Difference]: Start difference. First operand 34031 states and 110032 transitions. Second operand 3 states. [2019-12-18 21:40:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:17,293 INFO L93 Difference]: Finished difference Result 47990 states and 153962 transitions. [2019-12-18 21:40:17,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:40:17,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:40:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:17,372 INFO L225 Difference]: With dead ends: 47990 [2019-12-18 21:40:17,372 INFO L226 Difference]: Without dead ends: 47990 [2019-12-18 21:40:17,372 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:40:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47990 states. [2019-12-18 21:40:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47990 to 34147. [2019-12-18 21:40:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34147 states. [2019-12-18 21:40:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34147 states to 34147 states and 110505 transitions. [2019-12-18 21:40:18,033 INFO L78 Accepts]: Start accepts. Automaton has 34147 states and 110505 transitions. Word has length 66 [2019-12-18 21:40:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:18,033 INFO L462 AbstractCegarLoop]: Abstraction has 34147 states and 110505 transitions. [2019-12-18 21:40:18,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:40:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 34147 states and 110505 transitions. [2019-12-18 21:40:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:40:18,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:18,088 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:40:18,088 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:40:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:18,088 INFO L82 PathProgramCache]: Analyzing trace with hash -362141183, now seen corresponding path program 3 times [2019-12-18 21:40:18,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:18,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659858120] [2019-12-18 21:40:18,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:40:18,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659858120] [2019-12-18 21:40:18,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:18,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:40:18,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899152559] [2019-12-18 21:40:18,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:40:18,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:18,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:40:18,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:40:18,144 INFO L87 Difference]: Start difference. First operand 34147 states and 110505 transitions. Second operand 4 states. [2019-12-18 21:40:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:18,401 INFO L93 Difference]: Finished difference Result 40549 states and 129720 transitions. [2019-12-18 21:40:18,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:40:18,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 21:40:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:18,463 INFO L225 Difference]: With dead ends: 40549 [2019-12-18 21:40:18,463 INFO L226 Difference]: Without dead ends: 40549 [2019-12-18 21:40:18,464 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:40:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2019-12-18 21:40:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 34063. [2019-12-18 21:40:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34063 states. [2019-12-18 21:40:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34063 states to 34063 states and 110238 transitions. [2019-12-18 21:40:19,499 INFO L78 Accepts]: Start accepts. Automaton has 34063 states and 110238 transitions. Word has length 66 [2019-12-18 21:40:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:19,499 INFO L462 AbstractCegarLoop]: Abstraction has 34063 states and 110238 transitions. [2019-12-18 21:40:19,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:40:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 34063 states and 110238 transitions. [2019-12-18 21:40:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:40:19,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:19,540 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:40:19,540 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:40:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:19,540 INFO L82 PathProgramCache]: Analyzing trace with hash -909555473, now seen corresponding path program 4 times [2019-12-18 21:40:19,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:19,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734107373] [2019-12-18 21:40:19,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:19,617 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:40:19,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734107373] [2019-12-18 21:40:19,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:19,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:40:19,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152801394] [2019-12-18 21:40:19,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:40:19,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:40:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:40:19,619 INFO L87 Difference]: Start difference. First operand 34063 states and 110238 transitions. Second operand 7 states. [2019-12-18 21:40:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:20,186 INFO L93 Difference]: Finished difference Result 70631 states and 224909 transitions. [2019-12-18 21:40:20,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:40:20,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 21:40:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:20,288 INFO L225 Difference]: With dead ends: 70631 [2019-12-18 21:40:20,289 INFO L226 Difference]: Without dead ends: 65098 [2019-12-18 21:40:20,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:40:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65098 states. [2019-12-18 21:40:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65098 to 34127. [2019-12-18 21:40:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34127 states. [2019-12-18 21:40:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34127 states to 34127 states and 110456 transitions. [2019-12-18 21:40:21,077 INFO L78 Accepts]: Start accepts. Automaton has 34127 states and 110456 transitions. Word has length 66 [2019-12-18 21:40:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:21,078 INFO L462 AbstractCegarLoop]: Abstraction has 34127 states and 110456 transitions. [2019-12-18 21:40:21,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:40:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 34127 states and 110456 transitions. [2019-12-18 21:40:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:40:21,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:21,117 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:40:21,117 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:40:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash 862222067, now seen corresponding path program 5 times [2019-12-18 21:40:21,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:21,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300036231] [2019-12-18 21:40:21,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:21,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:40:21,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300036231] [2019-12-18 21:40:21,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:21,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:40:21,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371802736] [2019-12-18 21:40:21,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:40:21,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:21,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:40:21,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:40:21,208 INFO L87 Difference]: Start difference. First operand 34127 states and 110456 transitions. Second operand 6 states. [2019-12-18 21:40:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:21,903 INFO L93 Difference]: Finished difference Result 53911 states and 174205 transitions. [2019-12-18 21:40:21,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:40:21,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 21:40:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:21,987 INFO L225 Difference]: With dead ends: 53911 [2019-12-18 21:40:21,987 INFO L226 Difference]: Without dead ends: 53911 [2019-12-18 21:40:21,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:40:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53911 states. [2019-12-18 21:40:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53911 to 35149. [2019-12-18 21:40:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35149 states. [2019-12-18 21:40:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35149 states to 35149 states and 113605 transitions. [2019-12-18 21:40:23,006 INFO L78 Accepts]: Start accepts. Automaton has 35149 states and 113605 transitions. Word has length 66 [2019-12-18 21:40:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:23,006 INFO L462 AbstractCegarLoop]: Abstraction has 35149 states and 113605 transitions. [2019-12-18 21:40:23,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:40:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 35149 states and 113605 transitions. [2019-12-18 21:40:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:40:23,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:23,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:40:23,048 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:40:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 605319499, now seen corresponding path program 6 times [2019-12-18 21:40:23,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:23,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254433066] [2019-12-18 21:40:23,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:23,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:40:23,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254433066] [2019-12-18 21:40:23,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:23,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:40:23,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772498062] [2019-12-18 21:40:23,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:40:23,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:23,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:40:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:40:23,115 INFO L87 Difference]: Start difference. First operand 35149 states and 113605 transitions. Second operand 4 states. [2019-12-18 21:40:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:23,392 INFO L93 Difference]: Finished difference Result 41357 states and 133048 transitions. [2019-12-18 21:40:23,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:40:23,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 21:40:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:23,492 INFO L225 Difference]: With dead ends: 41357 [2019-12-18 21:40:23,492 INFO L226 Difference]: Without dead ends: 41357 [2019-12-18 21:40:23,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:40:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41357 states. [2019-12-18 21:40:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41357 to 31976. [2019-12-18 21:40:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-18 21:40:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-18 21:40:24,180 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 66 [2019-12-18 21:40:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:24,180 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-18 21:40:24,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:40:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-18 21:40:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:40:24,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:24,220 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:40:24,220 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:40:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:24,220 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-18 21:40:24,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:24,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277401293] [2019-12-18 21:40:24,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:24,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:40:24,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277401293] [2019-12-18 21:40:24,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:24,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:40:24,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898314552] [2019-12-18 21:40:24,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:40:24,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:24,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:40:24,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:40:24,284 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 3 states. [2019-12-18 21:40:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:24,396 INFO L93 Difference]: Finished difference Result 26693 states and 84212 transitions. [2019-12-18 21:40:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:40:24,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:40:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:24,433 INFO L225 Difference]: With dead ends: 26693 [2019-12-18 21:40:24,433 INFO L226 Difference]: Without dead ends: 26693 [2019-12-18 21:40:24,433 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:40:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26693 states. [2019-12-18 21:40:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26693 to 24273. [2019-12-18 21:40:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-18 21:40:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-18 21:40:25,102 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-18 21:40:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:25,102 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-18 21:40:25,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:40:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-18 21:40:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:40:25,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:25,130 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:40:25,130 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:40:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:25,130 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-18 21:40:25,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:25,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256173109] [2019-12-18 21:40:25,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:25,277 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:40:25,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256173109] [2019-12-18 21:40:25,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:25,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:40:25,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312949017] [2019-12-18 21:40:25,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:40:25,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:25,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:40:25,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:40:25,279 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 10 states. [2019-12-18 21:40:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:26,913 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-18 21:40:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:40:26,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 21:40:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:26,985 INFO L225 Difference]: With dead ends: 35523 [2019-12-18 21:40:26,985 INFO L226 Difference]: Without dead ends: 28791 [2019-12-18 21:40:26,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:40:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-18 21:40:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-18 21:40:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-18 21:40:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-18 21:40:27,508 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-18 21:40:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:27,508 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-18 21:40:27,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:40:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-18 21:40:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:40:27,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:27,534 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:40:27,534 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:40:27,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:27,535 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-18 21:40:27,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:27,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214408771] [2019-12-18 21:40:27,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:27,721 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:40:27,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214408771] [2019-12-18 21:40:27,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:27,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:40:27,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955425426] [2019-12-18 21:40:27,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:40:27,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:40:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:40:27,723 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 10 states. [2019-12-18 21:40:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:29,000 INFO L93 Difference]: Finished difference Result 36137 states and 112823 transitions. [2019-12-18 21:40:29,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:40:29,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 21:40:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:29,046 INFO L225 Difference]: With dead ends: 36137 [2019-12-18 21:40:29,046 INFO L226 Difference]: Without dead ends: 30919 [2019-12-18 21:40:29,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:40:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2019-12-18 21:40:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 25169. [2019-12-18 21:40:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-18 21:40:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-18 21:40:29,499 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-18 21:40:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:29,499 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-18 21:40:29,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:40:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-18 21:40:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:40:29,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:29,528 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:40:29,528 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:40:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-18 21:40:29,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:29,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282588732] [2019-12-18 21:40:29,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:29,692 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:40:29,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282588732] [2019-12-18 21:40:29,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:29,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:40:29,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839902028] [2019-12-18 21:40:29,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:40:29,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:29,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:40:29,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:40:29,694 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 11 states. [2019-12-18 21:40:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:31,164 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-18 21:40:31,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:40:31,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:40:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:31,208 INFO L225 Difference]: With dead ends: 34459 [2019-12-18 21:40:31,208 INFO L226 Difference]: Without dead ends: 30448 [2019-12-18 21:40:31,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:40:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-18 21:40:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-18 21:40:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-18 21:40:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-18 21:40:31,654 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-18 21:40:31,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:31,654 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-18 21:40:31,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:40:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-18 21:40:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:40:31,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:31,683 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:40:31,683 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:40:31,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:31,684 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-18 21:40:31,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:31,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532931756] [2019-12-18 21:40:31,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:31,921 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:40:31,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532931756] [2019-12-18 21:40:31,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:31,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:40:31,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582971839] [2019-12-18 21:40:31,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:40:31,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:40:31,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:40:31,924 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 11 states. [2019-12-18 21:40:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:33,623 INFO L93 Difference]: Finished difference Result 50603 states and 158867 transitions. [2019-12-18 21:40:33,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 21:40:33,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:40:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:33,693 INFO L225 Difference]: With dead ends: 50603 [2019-12-18 21:40:33,694 INFO L226 Difference]: Without dead ends: 48055 [2019-12-18 21:40:33,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 21:40:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-18 21:40:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 28332. [2019-12-18 21:40:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28332 states. [2019-12-18 21:40:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 88818 transitions. [2019-12-18 21:40:34,299 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 88818 transitions. Word has length 67 [2019-12-18 21:40:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:34,299 INFO L462 AbstractCegarLoop]: Abstraction has 28332 states and 88818 transitions. [2019-12-18 21:40:34,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:40:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 88818 transitions. [2019-12-18 21:40:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:40:34,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:34,330 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:40:34,330 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:40:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-18 21:40:34,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:34,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928857386] [2019-12-18 21:40:34,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:40:34,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928857386] [2019-12-18 21:40:34,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:34,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:40:34,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259151349] [2019-12-18 21:40:34,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:40:34,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:34,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:40:34,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:40:34,523 INFO L87 Difference]: Start difference. First operand 28332 states and 88818 transitions. Second operand 11 states. [2019-12-18 21:40:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:35,841 INFO L93 Difference]: Finished difference Result 48656 states and 152081 transitions. [2019-12-18 21:40:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:40:35,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:40:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:35,899 INFO L225 Difference]: With dead ends: 48656 [2019-12-18 21:40:35,899 INFO L226 Difference]: Without dead ends: 40243 [2019-12-18 21:40:35,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:40:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40243 states. [2019-12-18 21:40:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40243 to 23379. [2019-12-18 21:40:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23379 states. [2019-12-18 21:40:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23379 states to 23379 states and 72980 transitions. [2019-12-18 21:40:36,406 INFO L78 Accepts]: Start accepts. Automaton has 23379 states and 72980 transitions. Word has length 67 [2019-12-18 21:40:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:36,406 INFO L462 AbstractCegarLoop]: Abstraction has 23379 states and 72980 transitions. [2019-12-18 21:40:36,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:40:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 23379 states and 72980 transitions. [2019-12-18 21:40:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:40:36,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:36,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:40:36,433 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:40:36,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 6 times [2019-12-18 21:40:36,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:36,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562151926] [2019-12-18 21:40:36,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:40:36,621 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:40:36,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562151926] [2019-12-18 21:40:36,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:40:36,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:40:36,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817753992] [2019-12-18 21:40:36,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:40:36,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:40:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:40:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:40:36,623 INFO L87 Difference]: Start difference. First operand 23379 states and 72980 transitions. Second operand 12 states. [2019-12-18 21:40:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:40:37,792 INFO L93 Difference]: Finished difference Result 40285 states and 125634 transitions. [2019-12-18 21:40:37,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:40:37,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 21:40:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:40:37,855 INFO L225 Difference]: With dead ends: 40285 [2019-12-18 21:40:37,855 INFO L226 Difference]: Without dead ends: 40042 [2019-12-18 21:40:37,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:40:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40042 states. [2019-12-18 21:40:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40042 to 23203. [2019-12-18 21:40:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23203 states. [2019-12-18 21:40:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23203 states to 23203 states and 72508 transitions. [2019-12-18 21:40:38,347 INFO L78 Accepts]: Start accepts. Automaton has 23203 states and 72508 transitions. Word has length 67 [2019-12-18 21:40:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:40:38,347 INFO L462 AbstractCegarLoop]: Abstraction has 23203 states and 72508 transitions. [2019-12-18 21:40:38,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:40:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 23203 states and 72508 transitions. [2019-12-18 21:40:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:40:38,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:40:38,370 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:40:38,370 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:40:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:40:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 7 times [2019-12-18 21:40:38,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:40:38,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386090249] [2019-12-18 21:40:38,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:40:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:40:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:40:38,479 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:40:38,479 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:40:38,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1318~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1318~0.base_21|) |v_ULTIMATE.start_main_~#t1318~0.offset_16| 0))) (= v_~main$tmp_guard0~0_10 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1318~0.base_21|) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1318~0.base_21| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~z$w_buff1_used~0_72) (= |v_ULTIMATE.start_main_~#t1318~0.offset_16| 0) (= 0 v_~weak$$choice0~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1318~0.base_21|) 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1318~0.base_21| 1) |v_#valid_59|) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t1320~0.base=|v_ULTIMATE.start_main_~#t1320~0.base_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t1318~0.base=|v_ULTIMATE.start_main_~#t1318~0.base_21|, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1319~0.base=|v_ULTIMATE.start_main_~#t1319~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ULTIMATE.start_main_~#t1318~0.offset=|v_ULTIMATE.start_main_~#t1318~0.offset_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t1320~0.offset=|v_ULTIMATE.start_main_~#t1320~0.offset_15|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1319~0.offset=|v_ULTIMATE.start_main_~#t1319~0.offset_13|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1320~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1318~0.base, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1319~0.base, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1318~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1320~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1319~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:40:38,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1319~0.base_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1319~0.base_11| 1) |v_#valid_38|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1319~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1319~0.base_11|) |v_ULTIMATE.start_main_~#t1319~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1319~0.base_11| 4) |v_#length_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1319~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1319~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1319~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1319~0.offset=|v_ULTIMATE.start_main_~#t1319~0.offset_9|, ULTIMATE.start_main_~#t1319~0.base=|v_ULTIMATE.start_main_~#t1319~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1319~0.offset, ULTIMATE.start_main_~#t1319~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 21:40:38,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:40:38,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1639131432 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1639131432 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1639131432| ~z~0_In1639131432) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1639131432| ~z$w_buff1~0_In1639131432) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1639131432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1639131432, ~z$w_buff1~0=~z$w_buff1~0_In1639131432, ~z~0=~z~0_In1639131432} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1639131432|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1639131432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1639131432, ~z$w_buff1~0=~z$w_buff1~0_In1639131432, ~z~0=~z~0_In1639131432} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 21:40:38,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 21:40:38,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1320~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1320~0.base_13| 1) |v_#valid_36|) (= |v_ULTIMATE.start_main_~#t1320~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1320~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t1320~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1320~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1320~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1320~0.base_13|) |v_ULTIMATE.start_main_~#t1320~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1320~0.base=|v_ULTIMATE.start_main_~#t1320~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1320~0.offset=|v_ULTIMATE.start_main_~#t1320~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1320~0.base, #length, ULTIMATE.start_main_~#t1320~0.offset] because there is no mapped edge [2019-12-18 21:40:38,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In622236932 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In622236932 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out622236932| ~z$w_buff0_used~0_In622236932) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out622236932|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In622236932, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In622236932} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In622236932, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out622236932|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In622236932} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 21:40:38,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In253720436 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In253720436 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In253720436 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In253720436 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out253720436| ~z$w_buff1_used~0_In253720436) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out253720436|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In253720436, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In253720436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In253720436, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In253720436} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In253720436, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In253720436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In253720436, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out253720436|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In253720436} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 21:40:38,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In565126677 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In565126677 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out565126677| ~z$r_buff0_thd2~0_In565126677) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out565126677| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In565126677, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In565126677} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In565126677, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out565126677|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In565126677} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 21:40:38,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1622688075 256)))) (or (and .cse0 (= ~z$w_buff0_used~0_In-1622688075 |P2Thread1of1ForFork0_#t~ite26_Out-1622688075|) (= |P2Thread1of1ForFork0_#t~ite27_Out-1622688075| |P2Thread1of1ForFork0_#t~ite26_Out-1622688075|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1622688075 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1622688075 256))) (and (= 0 (mod ~z$w_buff1_used~0_In-1622688075 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1622688075 256))))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-1622688075| ~z$w_buff0_used~0_In-1622688075) (= |P2Thread1of1ForFork0_#t~ite26_In-1622688075| |P2Thread1of1ForFork0_#t~ite26_Out-1622688075|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1622688075|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1622688075, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1622688075, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1622688075, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1622688075, ~weak$$choice2~0=~weak$$choice2~0_In-1622688075} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1622688075|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1622688075|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1622688075, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1622688075, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1622688075, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1622688075, ~weak$$choice2~0=~weak$$choice2~0_In-1622688075} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 21:40:38,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 21:40:38,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In968746357 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In968746357 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out968746357|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In968746357 |P0Thread1of1ForFork1_#t~ite5_Out968746357|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In968746357, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In968746357} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out968746357|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In968746357, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In968746357} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 21:40:38,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:40:38,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out-276123059| |P2Thread1of1ForFork0_#t~ite39_Out-276123059|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-276123059 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-276123059 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-276123059| ~z$w_buff1~0_In-276123059)) (and .cse1 (or .cse0 .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-276123059| ~z~0_In-276123059)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-276123059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-276123059, ~z$w_buff1~0=~z$w_buff1~0_In-276123059, ~z~0=~z~0_In-276123059} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-276123059|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-276123059|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-276123059, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-276123059, ~z$w_buff1~0=~z$w_buff1~0_In-276123059, ~z~0=~z~0_In-276123059} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:40:38,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1290437844 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1290437844 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1290437844 |P2Thread1of1ForFork0_#t~ite40_Out1290437844|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1290437844|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1290437844, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1290437844} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1290437844, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1290437844|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1290437844} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 21:40:38,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1574370220 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1574370220 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1574370220 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1574370220 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1574370220|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1574370220 |P2Thread1of1ForFork0_#t~ite41_Out1574370220|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1574370220, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1574370220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1574370220, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1574370220} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1574370220, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1574370220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1574370220, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1574370220, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1574370220|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 21:40:38,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-779612626 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-779612626 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-779612626|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-779612626| ~z$r_buff0_thd3~0_In-779612626) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-779612626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-779612626} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-779612626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-779612626, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-779612626|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 21:40:38,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1294485529 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1294485529 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1294485529 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1294485529 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-1294485529 |P2Thread1of1ForFork0_#t~ite43_Out-1294485529|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1294485529|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294485529, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1294485529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1294485529, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1294485529} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1294485529|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294485529, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1294485529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1294485529, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1294485529} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 21:40:38,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:40:38,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In972622194 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In972622194 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In972622194 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In972622194 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out972622194|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In972622194 |P0Thread1of1ForFork1_#t~ite6_Out972622194|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In972622194, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In972622194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In972622194, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In972622194} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In972622194, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out972622194|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In972622194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In972622194, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In972622194} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 21:40:38,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-2133661549 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2133661549 256)))) (or (and (= ~z$r_buff0_thd1~0_In-2133661549 ~z$r_buff0_thd1~0_Out-2133661549) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$r_buff0_thd1~0_Out-2133661549 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133661549, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2133661549} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133661549, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-2133661549|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2133661549} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:40:38,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-785694157 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-785694157 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-785694157 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-785694157 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-785694157| ~z$r_buff1_thd1~0_In-785694157)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-785694157| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-785694157, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-785694157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-785694157, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-785694157} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-785694157|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-785694157, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-785694157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-785694157, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-785694157} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:40:38,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 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_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:40:38,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-1990912327 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1990912327 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1990912327 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1990912327 256) 0))) (or (and (= ~z$r_buff1_thd2~0_In-1990912327 |P1Thread1of1ForFork2_#t~ite14_Out-1990912327|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1990912327|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1990912327, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1990912327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1990912327, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1990912327} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1990912327, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1990912327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1990912327, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1990912327|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1990912327} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 21:40:38,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:40:38,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:40:38,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1753304445 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1753304445| |ULTIMATE.start_main_#t~ite47_Out-1753304445|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1753304445 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1753304445| ~z~0_In-1753304445) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1753304445| ~z$w_buff1~0_In-1753304445) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1753304445, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1753304445, ~z$w_buff1~0=~z$w_buff1~0_In-1753304445, ~z~0=~z~0_In-1753304445} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1753304445, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1753304445|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1753304445, ~z$w_buff1~0=~z$w_buff1~0_In-1753304445, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1753304445|, ~z~0=~z~0_In-1753304445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:40:38,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2047831006 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2047831006 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-2047831006| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-2047831006| ~z$w_buff0_used~0_In-2047831006) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2047831006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2047831006} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2047831006, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2047831006, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2047831006|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:40:38,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1659750760 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1659750760 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1659750760 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1659750760 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1659750760| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite50_Out-1659750760| ~z$w_buff1_used~0_In-1659750760) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1659750760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659750760, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1659750760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659750760} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1659750760|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1659750760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659750760, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1659750760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659750760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:40:38,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-259191525 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-259191525 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-259191525|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-259191525 |ULTIMATE.start_main_#t~ite51_Out-259191525|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-259191525, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-259191525} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-259191525, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-259191525|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-259191525} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:40:38,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In787805026 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In787805026 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In787805026 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In787805026 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In787805026 |ULTIMATE.start_main_#t~ite52_Out787805026|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite52_Out787805026|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In787805026, ~z$w_buff0_used~0=~z$w_buff0_used~0_In787805026, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In787805026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In787805026} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out787805026|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In787805026, ~z$w_buff0_used~0=~z$w_buff0_used~0_In787805026, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In787805026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In787805026} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:40:38,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:40:38,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:40:38 BasicIcfg [2019-12-18 21:40:38,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:40:38,643 INFO L168 Benchmark]: Toolchain (without parser) took 110229.11 ms. Allocated memory was 146.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 21:40:38,644 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:40:38,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.26 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 157.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:40:38,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.42 ms. Allocated memory is still 204.5 MB. Free memory was 157.1 MB in the beginning and 154.3 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:40:38,648 INFO L168 Benchmark]: Boogie Preprocessor took 41.50 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 151.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:40:38,652 INFO L168 Benchmark]: RCFGBuilder took 865.90 ms. Allocated memory is still 204.5 MB. Free memory was 151.5 MB in the beginning and 101.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:40:38,653 INFO L168 Benchmark]: TraceAbstraction took 108396.46 ms. Allocated memory was 204.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 21:40:38,655 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.20 ms. Allocated memory is still 146.8 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 851.26 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 157.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.42 ms. Allocated memory is still 204.5 MB. Free memory was 157.1 MB in the beginning and 154.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.50 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 865.90 ms. Allocated memory is still 204.5 MB. Free memory was 151.5 MB in the beginning and 101.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108396.46 ms. Allocated memory was 204.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1318, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1319, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1320, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.0s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6971 SDtfs, 8292 SDslu, 26406 SDs, 0 SdLazy, 11049 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 44 SyntacticMatches, 13 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 46.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 306601 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1475 NumberOfCodeBlocks, 1475 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1379 ConstructedInterpolants, 0 QuantifiedInterpolants, 270649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...