/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/mix028_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:57:45,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:57:45,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:57:45,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:57:45,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:57:45,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:57:45,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:57:45,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:57:45,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:57:45,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:57:45,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:57:45,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:57:45,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:57:45,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:57:45,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:57:45,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:57:45,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:57:45,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:57:45,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:57:45,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:57:45,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:57:45,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:57:45,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:57:45,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:57:45,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:57:45,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:57:45,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:57:45,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:57:45,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:57:45,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:57:45,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:57:45,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:57:45,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:57:45,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:57:45,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:57:45,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:57:45,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:57:45,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:57:45,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:57:45,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:57:45,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:57:45,297 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 20:57:45,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:57:45,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:57:45,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:57:45,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:57:45,322 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:57:45,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:57:45,323 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:57:45,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:57:45,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:57:45,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:57:45,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:57:45,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:57:45,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:57:45,325 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:57:45,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:57:45,326 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:57:45,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:57:45,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:57:45,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:57:45,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:57:45,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:57:45,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:57:45,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:57:45,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:57:45,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:57:45,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:57:45,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:57:45,328 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:57:45,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:57:45,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:57:45,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:57:45,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:57:45,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:57:45,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:57:45,647 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:57:45,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i [2019-12-18 20:57:45,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971ada10f/874860dbf87b4a06bc54e09539ebc090/FLAG033e0c3a1 [2019-12-18 20:57:46,270 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:57:46,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i [2019-12-18 20:57:46,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971ada10f/874860dbf87b4a06bc54e09539ebc090/FLAG033e0c3a1 [2019-12-18 20:57:46,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971ada10f/874860dbf87b4a06bc54e09539ebc090 [2019-12-18 20:57:46,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:57:46,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:57:46,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:57:46,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:57:46,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:57:46,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:57:46" (1/1) ... [2019-12-18 20:57:46,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:46, skipping insertion in model container [2019-12-18 20:57:46,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:57:46" (1/1) ... [2019-12-18 20:57:46,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:57:46,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:57:47,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:57:47,200 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:57:47,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:57:47,360 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:57:47,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47 WrapperNode [2019-12-18 20:57:47,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:57:47,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:57:47,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:57:47,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:57:47,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (1/1) ... [2019-12-18 20:57:47,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (1/1) ... [2019-12-18 20:57:47,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:57:47,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:57:47,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:57:47,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:57:47,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (1/1) ... [2019-12-18 20:57:47,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (1/1) ... [2019-12-18 20:57:47,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (1/1) ... [2019-12-18 20:57:47,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (1/1) ... [2019-12-18 20:57:47,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (1/1) ... [2019-12-18 20:57:47,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (1/1) ... [2019-12-18 20:57:47,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (1/1) ... [2019-12-18 20:57:47,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:57:47,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:57:47,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:57:47,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:57:47,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (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 20:57:47,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:57:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:57:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:57:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:57:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:57:47,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:57:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:57:47,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:57:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:57:47,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:57:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:57:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:57:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:57:47,549 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 20:57:48,343 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:57:48,343 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:57:48,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:57:48 BoogieIcfgContainer [2019-12-18 20:57:48,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:57:48,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:57:48,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:57:48,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:57:48,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:57:46" (1/3) ... [2019-12-18 20:57:48,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480aa5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:57:48, skipping insertion in model container [2019-12-18 20:57:48,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:57:47" (2/3) ... [2019-12-18 20:57:48,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480aa5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:57:48, skipping insertion in model container [2019-12-18 20:57:48,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:57:48" (3/3) ... [2019-12-18 20:57:48,355 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc.i [2019-12-18 20:57:48,366 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:57:48,367 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:57:48,383 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:57:48,384 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:57:48,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,432 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,433 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,497 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,499 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,500 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,504 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,506 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:57:48,525 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:57:48,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:57:48,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:57:48,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:57:48,546 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:57:48,546 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:57:48,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:57:48,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:57:48,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:57:48,563 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 20:57:48,565 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 20:57:48,654 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 20:57:48,655 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:57:48,675 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:57:48,707 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 20:57:48,755 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 20:57:48,755 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:57:48,767 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:57:48,794 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:57:48,795 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:57:52,449 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 20:57:52,568 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 20:57:52,721 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 20:57:52,830 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 20:57:52,858 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91527 [2019-12-18 20:57:52,859 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 20:57:52,862 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-18 20:58:13,811 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125922 states. [2019-12-18 20:58:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 125922 states. [2019-12-18 20:58:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:58:13,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:13,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:58:13,820 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 20:58:13,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash 908043, now seen corresponding path program 1 times [2019-12-18 20:58:13,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:13,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653836936] [2019-12-18 20:58:13,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:14,056 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 20:58:14,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653836936] [2019-12-18 20:58:14,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:14,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:58:14,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421636096] [2019-12-18 20:58:14,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:58:14,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:14,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:58:14,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:14,084 INFO L87 Difference]: Start difference. First operand 125922 states. Second operand 3 states. [2019-12-18 20:58:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:17,664 INFO L93 Difference]: Finished difference Result 124322 states and 530209 transitions. [2019-12-18 20:58:17,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:58:17,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:58:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:18,320 INFO L225 Difference]: With dead ends: 124322 [2019-12-18 20:58:18,321 INFO L226 Difference]: Without dead ends: 116482 [2019-12-18 20:58:18,322 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 20:58:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116482 states. [2019-12-18 20:58:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116482 to 116482. [2019-12-18 20:58:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116482 states. [2019-12-18 20:58:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116482 states to 116482 states and 496133 transitions. [2019-12-18 20:58:30,394 INFO L78 Accepts]: Start accepts. Automaton has 116482 states and 496133 transitions. Word has length 3 [2019-12-18 20:58:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:30,394 INFO L462 AbstractCegarLoop]: Abstraction has 116482 states and 496133 transitions. [2019-12-18 20:58:30,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:58:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 116482 states and 496133 transitions. [2019-12-18 20:58:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:58:30,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:30,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:30,399 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 20:58:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1212771218, now seen corresponding path program 1 times [2019-12-18 20:58:30,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:30,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884693121] [2019-12-18 20:58:30,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:30,597 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 20:58:30,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884693121] [2019-12-18 20:58:30,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:30,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:58:30,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116603767] [2019-12-18 20:58:30,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:58:30,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:30,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:58:30,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:58:30,601 INFO L87 Difference]: Start difference. First operand 116482 states and 496133 transitions. Second operand 4 states. [2019-12-18 20:58:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:36,736 INFO L93 Difference]: Finished difference Result 180190 states and 733879 transitions. [2019-12-18 20:58:36,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:58:36,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:58:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:37,488 INFO L225 Difference]: With dead ends: 180190 [2019-12-18 20:58:37,488 INFO L226 Difference]: Without dead ends: 180141 [2019-12-18 20:58:37,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 20:58:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180141 states. [2019-12-18 20:58:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180141 to 164613. [2019-12-18 20:58:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164613 states. [2019-12-18 20:58:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164613 states to 164613 states and 679726 transitions. [2019-12-18 20:58:47,157 INFO L78 Accepts]: Start accepts. Automaton has 164613 states and 679726 transitions. Word has length 11 [2019-12-18 20:58:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:47,158 INFO L462 AbstractCegarLoop]: Abstraction has 164613 states and 679726 transitions. [2019-12-18 20:58:47,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:58:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 164613 states and 679726 transitions. [2019-12-18 20:58:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:58:47,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:47,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:47,164 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 20:58:47,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1823920575, now seen corresponding path program 1 times [2019-12-18 20:58:47,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:47,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452186355] [2019-12-18 20:58:47,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:47,230 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 20:58:47,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452186355] [2019-12-18 20:58:47,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:47,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:58:47,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334332807] [2019-12-18 20:58:47,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:58:47,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:47,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:58:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:47,233 INFO L87 Difference]: Start difference. First operand 164613 states and 679726 transitions. Second operand 3 states. [2019-12-18 20:58:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:47,410 INFO L93 Difference]: Finished difference Result 35147 states and 113815 transitions. [2019-12-18 20:58:47,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:58:47,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:58:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:47,489 INFO L225 Difference]: With dead ends: 35147 [2019-12-18 20:58:47,489 INFO L226 Difference]: Without dead ends: 35147 [2019-12-18 20:58:47,489 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 20:58:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35147 states. [2019-12-18 20:58:52,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35147 to 35147. [2019-12-18 20:58:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35147 states. [2019-12-18 20:58:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35147 states to 35147 states and 113815 transitions. [2019-12-18 20:58:53,053 INFO L78 Accepts]: Start accepts. Automaton has 35147 states and 113815 transitions. Word has length 13 [2019-12-18 20:58:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:53,053 INFO L462 AbstractCegarLoop]: Abstraction has 35147 states and 113815 transitions. [2019-12-18 20:58:53,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:58:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 35147 states and 113815 transitions. [2019-12-18 20:58:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:58:53,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:53,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:53,056 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 20:58:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1449560352, now seen corresponding path program 1 times [2019-12-18 20:58:53,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:53,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857270929] [2019-12-18 20:58:53,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:53,159 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 20:58:53,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857270929] [2019-12-18 20:58:53,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:53,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:58:53,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066946607] [2019-12-18 20:58:53,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:58:53,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:53,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:58:53,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:58:53,161 INFO L87 Difference]: Start difference. First operand 35147 states and 113815 transitions. Second operand 4 states. [2019-12-18 20:58:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:53,581 INFO L93 Difference]: Finished difference Result 43322 states and 139794 transitions. [2019-12-18 20:58:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:58:53,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:58:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:53,651 INFO L225 Difference]: With dead ends: 43322 [2019-12-18 20:58:53,651 INFO L226 Difference]: Without dead ends: 43322 [2019-12-18 20:58:53,651 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 20:58:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43322 states. [2019-12-18 20:58:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43322 to 38937. [2019-12-18 20:58:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38937 states. [2019-12-18 20:58:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38937 states to 38937 states and 126079 transitions. [2019-12-18 20:58:54,347 INFO L78 Accepts]: Start accepts. Automaton has 38937 states and 126079 transitions. Word has length 16 [2019-12-18 20:58:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:54,348 INFO L462 AbstractCegarLoop]: Abstraction has 38937 states and 126079 transitions. [2019-12-18 20:58:54,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:58:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 38937 states and 126079 transitions. [2019-12-18 20:58:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:58:54,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:54,358 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 20:58:54,358 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 20:58:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:54,359 INFO L82 PathProgramCache]: Analyzing trace with hash 204872371, now seen corresponding path program 1 times [2019-12-18 20:58:54,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:54,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012686531] [2019-12-18 20:58:54,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:54,551 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 20:58:54,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012686531] [2019-12-18 20:58:54,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:54,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:58:54,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110921079] [2019-12-18 20:58:54,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:58:54,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:54,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:58:54,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:58:54,554 INFO L87 Difference]: Start difference. First operand 38937 states and 126079 transitions. Second operand 5 states. [2019-12-18 20:58:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:55,631 INFO L93 Difference]: Finished difference Result 49988 states and 158806 transitions. [2019-12-18 20:58:55,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:58:55,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:58:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:55,715 INFO L225 Difference]: With dead ends: 49988 [2019-12-18 20:58:55,715 INFO L226 Difference]: Without dead ends: 49981 [2019-12-18 20:58:55,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:58:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49981 states. [2019-12-18 20:58:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49981 to 38342. [2019-12-18 20:58:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38342 states. [2019-12-18 20:58:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38342 states to 38342 states and 123948 transitions. [2019-12-18 20:58:56,448 INFO L78 Accepts]: Start accepts. Automaton has 38342 states and 123948 transitions. Word has length 22 [2019-12-18 20:58:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:56,449 INFO L462 AbstractCegarLoop]: Abstraction has 38342 states and 123948 transitions. [2019-12-18 20:58:56,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:58:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 38342 states and 123948 transitions. [2019-12-18 20:58:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:58:56,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:56,464 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 20:58:56,464 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 20:58:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1423833073, now seen corresponding path program 1 times [2019-12-18 20:58:56,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:56,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744912539] [2019-12-18 20:58:56,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:56,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 20:58:56,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744912539] [2019-12-18 20:58:56,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:56,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:58:56,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759529609] [2019-12-18 20:58:56,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:58:56,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:56,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:58:56,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:58:56,519 INFO L87 Difference]: Start difference. First operand 38342 states and 123948 transitions. Second operand 4 states. [2019-12-18 20:58:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:56,596 INFO L93 Difference]: Finished difference Result 15734 states and 48101 transitions. [2019-12-18 20:58:56,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:58:56,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:58:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:56,617 INFO L225 Difference]: With dead ends: 15734 [2019-12-18 20:58:56,618 INFO L226 Difference]: Without dead ends: 15734 [2019-12-18 20:58:56,618 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 20:58:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15734 states. [2019-12-18 20:58:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15734 to 15406. [2019-12-18 20:58:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15406 states. [2019-12-18 20:58:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15406 states to 15406 states and 47165 transitions. [2019-12-18 20:58:56,851 INFO L78 Accepts]: Start accepts. Automaton has 15406 states and 47165 transitions. Word has length 25 [2019-12-18 20:58:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:56,852 INFO L462 AbstractCegarLoop]: Abstraction has 15406 states and 47165 transitions. [2019-12-18 20:58:56,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:58:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 15406 states and 47165 transitions. [2019-12-18 20:58:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:58:56,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:56,866 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 20:58:56,866 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 20:58:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1264901425, now seen corresponding path program 1 times [2019-12-18 20:58:56,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:56,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522223669] [2019-12-18 20:58:56,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:58:56,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522223669] [2019-12-18 20:58:56,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:56,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:58:56,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865154886] [2019-12-18 20:58:56,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:58:56,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:58:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:56,916 INFO L87 Difference]: Start difference. First operand 15406 states and 47165 transitions. Second operand 3 states. [2019-12-18 20:58:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:57,016 INFO L93 Difference]: Finished difference Result 21904 states and 65900 transitions. [2019-12-18 20:58:57,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:58:57,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 20:58:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:57,048 INFO L225 Difference]: With dead ends: 21904 [2019-12-18 20:58:57,048 INFO L226 Difference]: Without dead ends: 21904 [2019-12-18 20:58:57,048 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 20:58:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21904 states. [2019-12-18 20:58:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21904 to 16260. [2019-12-18 20:58:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16260 states. [2019-12-18 20:58:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16260 states to 16260 states and 49623 transitions. [2019-12-18 20:58:57,595 INFO L78 Accepts]: Start accepts. Automaton has 16260 states and 49623 transitions. Word has length 27 [2019-12-18 20:58:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:57,596 INFO L462 AbstractCegarLoop]: Abstraction has 16260 states and 49623 transitions. [2019-12-18 20:58:57,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:58:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 16260 states and 49623 transitions. [2019-12-18 20:58:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:58:57,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:57,607 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 20:58:57,608 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 20:58:57,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:57,608 INFO L82 PathProgramCache]: Analyzing trace with hash 825307065, now seen corresponding path program 1 times [2019-12-18 20:58:57,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:57,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495413051] [2019-12-18 20:58:57,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:57,732 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 20:58:57,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495413051] [2019-12-18 20:58:57,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:57,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:58:57,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069556581] [2019-12-18 20:58:57,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:58:57,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:58:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:58:57,734 INFO L87 Difference]: Start difference. First operand 16260 states and 49623 transitions. Second operand 6 states. [2019-12-18 20:58:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:58,675 INFO L93 Difference]: Finished difference Result 41406 states and 124717 transitions. [2019-12-18 20:58:58,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:58:58,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 20:58:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:58,776 INFO L225 Difference]: With dead ends: 41406 [2019-12-18 20:58:58,776 INFO L226 Difference]: Without dead ends: 41406 [2019-12-18 20:58:58,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:58:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41406 states. [2019-12-18 20:58:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41406 to 23188. [2019-12-18 20:58:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23188 states. [2019-12-18 20:58:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23188 states to 23188 states and 71773 transitions. [2019-12-18 20:58:59,434 INFO L78 Accepts]: Start accepts. Automaton has 23188 states and 71773 transitions. Word has length 27 [2019-12-18 20:58:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:59,434 INFO L462 AbstractCegarLoop]: Abstraction has 23188 states and 71773 transitions. [2019-12-18 20:58:59,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:58:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 23188 states and 71773 transitions. [2019-12-18 20:58:59,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:58:59,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:59,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:59,453 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 20:58:59,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:59,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1446029100, now seen corresponding path program 1 times [2019-12-18 20:58:59,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:59,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851275171] [2019-12-18 20:58:59,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:59,560 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 20:58:59,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851275171] [2019-12-18 20:58:59,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:59,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:58:59,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945055033] [2019-12-18 20:58:59,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:58:59,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:58:59,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:58:59,563 INFO L87 Difference]: Start difference. First operand 23188 states and 71773 transitions. Second operand 6 states. [2019-12-18 20:58:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:59,728 INFO L93 Difference]: Finished difference Result 30156 states and 89920 transitions. [2019-12-18 20:58:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:58:59,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 20:58:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:59,769 INFO L225 Difference]: With dead ends: 30156 [2019-12-18 20:58:59,769 INFO L226 Difference]: Without dead ends: 30156 [2019-12-18 20:58:59,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:58:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2019-12-18 20:59:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 21345. [2019-12-18 20:59:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21345 states. [2019-12-18 20:59:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21345 states to 21345 states and 64073 transitions. [2019-12-18 20:59:00,132 INFO L78 Accepts]: Start accepts. Automaton has 21345 states and 64073 transitions. Word has length 28 [2019-12-18 20:59:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:00,133 INFO L462 AbstractCegarLoop]: Abstraction has 21345 states and 64073 transitions. [2019-12-18 20:59:00,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:59:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 21345 states and 64073 transitions. [2019-12-18 20:59:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 20:59:00,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:00,149 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] [2019-12-18 20:59:00,150 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 20:59:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash 175505825, now seen corresponding path program 1 times [2019-12-18 20:59:00,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:00,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383167222] [2019-12-18 20:59:00,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:00,254 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 20:59:00,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383167222] [2019-12-18 20:59:00,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:00,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:59:00,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260979412] [2019-12-18 20:59:00,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:59:00,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:59:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:59:00,258 INFO L87 Difference]: Start difference. First operand 21345 states and 64073 transitions. Second operand 6 states. [2019-12-18 20:59:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:01,272 INFO L93 Difference]: Finished difference Result 32208 states and 95012 transitions. [2019-12-18 20:59:01,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:59:01,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 20:59:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:01,334 INFO L225 Difference]: With dead ends: 32208 [2019-12-18 20:59:01,334 INFO L226 Difference]: Without dead ends: 32208 [2019-12-18 20:59:01,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:59:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32208 states. [2019-12-18 20:59:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32208 to 21099. [2019-12-18 20:59:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21099 states. [2019-12-18 20:59:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21099 states to 21099 states and 63380 transitions. [2019-12-18 20:59:01,743 INFO L78 Accepts]: Start accepts. Automaton has 21099 states and 63380 transitions. Word has length 29 [2019-12-18 20:59:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:01,743 INFO L462 AbstractCegarLoop]: Abstraction has 21099 states and 63380 transitions. [2019-12-18 20:59:01,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:59:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 21099 states and 63380 transitions. [2019-12-18 20:59:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:59:01,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:01,766 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 20:59:01,766 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 20:59:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash 260418188, now seen corresponding path program 1 times [2019-12-18 20:59:01,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:01,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674380604] [2019-12-18 20:59:01,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:01,916 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 20:59:01,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674380604] [2019-12-18 20:59:01,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:01,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:59:01,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98079390] [2019-12-18 20:59:01,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:59:01,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:01,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:59:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:59:01,919 INFO L87 Difference]: Start difference. First operand 21099 states and 63380 transitions. Second operand 7 states. [2019-12-18 20:59:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:03,332 INFO L93 Difference]: Finished difference Result 42577 states and 125019 transitions. [2019-12-18 20:59:03,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 20:59:03,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 20:59:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:03,399 INFO L225 Difference]: With dead ends: 42577 [2019-12-18 20:59:03,399 INFO L226 Difference]: Without dead ends: 42577 [2019-12-18 20:59:03,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:59:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42577 states. [2019-12-18 20:59:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42577 to 23227. [2019-12-18 20:59:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23227 states. [2019-12-18 20:59:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23227 states to 23227 states and 69703 transitions. [2019-12-18 20:59:03,891 INFO L78 Accepts]: Start accepts. Automaton has 23227 states and 69703 transitions. Word has length 33 [2019-12-18 20:59:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:03,892 INFO L462 AbstractCegarLoop]: Abstraction has 23227 states and 69703 transitions. [2019-12-18 20:59:03,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:59:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 23227 states and 69703 transitions. [2019-12-18 20:59:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:59:03,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:03,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] [2019-12-18 20:59:03,915 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 20:59:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 262762204, now seen corresponding path program 2 times [2019-12-18 20:59:03,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:03,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093663214] [2019-12-18 20:59:03,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:04,041 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 20:59:04,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093663214] [2019-12-18 20:59:04,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:04,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:59:04,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721133652] [2019-12-18 20:59:04,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:59:04,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:04,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:59:04,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:59:04,043 INFO L87 Difference]: Start difference. First operand 23227 states and 69703 transitions. Second operand 8 states. [2019-12-18 20:59:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:06,214 INFO L93 Difference]: Finished difference Result 49904 states and 145498 transitions. [2019-12-18 20:59:06,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 20:59:06,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 20:59:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:06,286 INFO L225 Difference]: With dead ends: 49904 [2019-12-18 20:59:06,286 INFO L226 Difference]: Without dead ends: 49904 [2019-12-18 20:59:06,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:59:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49904 states. [2019-12-18 20:59:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49904 to 22498. [2019-12-18 20:59:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22498 states. [2019-12-18 20:59:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22498 states to 22498 states and 67422 transitions. [2019-12-18 20:59:06,786 INFO L78 Accepts]: Start accepts. Automaton has 22498 states and 67422 transitions. Word has length 33 [2019-12-18 20:59:06,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:06,786 INFO L462 AbstractCegarLoop]: Abstraction has 22498 states and 67422 transitions. [2019-12-18 20:59:06,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:59:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 22498 states and 67422 transitions. [2019-12-18 20:59:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:59:06,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:06,805 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] [2019-12-18 20:59:06,805 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 20:59:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash -829106450, now seen corresponding path program 1 times [2019-12-18 20:59:06,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:06,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319557618] [2019-12-18 20:59:06,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:06,922 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 20:59:06,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319557618] [2019-12-18 20:59:06,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:06,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:59:06,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055553430] [2019-12-18 20:59:06,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:59:06,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:06,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:59:06,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:59:06,924 INFO L87 Difference]: Start difference. First operand 22498 states and 67422 transitions. Second operand 7 states. [2019-12-18 20:59:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:08,222 INFO L93 Difference]: Finished difference Result 49815 states and 143935 transitions. [2019-12-18 20:59:08,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:59:08,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 20:59:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:08,295 INFO L225 Difference]: With dead ends: 49815 [2019-12-18 20:59:08,295 INFO L226 Difference]: Without dead ends: 49815 [2019-12-18 20:59:08,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:59:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49815 states. [2019-12-18 20:59:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49815 to 24080. [2019-12-18 20:59:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24080 states. [2019-12-18 20:59:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24080 states to 24080 states and 71947 transitions. [2019-12-18 20:59:08,853 INFO L78 Accepts]: Start accepts. Automaton has 24080 states and 71947 transitions. Word has length 35 [2019-12-18 20:59:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:08,853 INFO L462 AbstractCegarLoop]: Abstraction has 24080 states and 71947 transitions. [2019-12-18 20:59:08,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:59:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 24080 states and 71947 transitions. [2019-12-18 20:59:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:59:08,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:08,883 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] [2019-12-18 20:59:08,883 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 20:59:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:08,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1167528844, now seen corresponding path program 2 times [2019-12-18 20:59:08,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:08,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626058288] [2019-12-18 20:59:08,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:09,024 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 20:59:09,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626058288] [2019-12-18 20:59:09,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:09,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:59:09,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376530730] [2019-12-18 20:59:09,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:59:09,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:09,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:59:09,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:59:09,026 INFO L87 Difference]: Start difference. First operand 24080 states and 71947 transitions. Second operand 8 states. [2019-12-18 20:59:09,778 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-18 20:59:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:11,232 INFO L93 Difference]: Finished difference Result 45574 states and 132156 transitions. [2019-12-18 20:59:11,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 20:59:11,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-18 20:59:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:11,305 INFO L225 Difference]: With dead ends: 45574 [2019-12-18 20:59:11,305 INFO L226 Difference]: Without dead ends: 45574 [2019-12-18 20:59:11,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:59:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45574 states. [2019-12-18 20:59:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45574 to 19329. [2019-12-18 20:59:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19329 states. [2019-12-18 20:59:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19329 states to 19329 states and 58275 transitions. [2019-12-18 20:59:11,760 INFO L78 Accepts]: Start accepts. Automaton has 19329 states and 58275 transitions. Word has length 35 [2019-12-18 20:59:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:11,760 INFO L462 AbstractCegarLoop]: Abstraction has 19329 states and 58275 transitions. [2019-12-18 20:59:11,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:59:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 19329 states and 58275 transitions. [2019-12-18 20:59:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:59:11,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:11,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:11,782 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 20:59:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash -513814734, now seen corresponding path program 1 times [2019-12-18 20:59:11,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:11,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959711741] [2019-12-18 20:59:11,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:11,827 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 20:59:11,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959711741] [2019-12-18 20:59:11,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:11,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:59:11,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022876954] [2019-12-18 20:59:11,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:11,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:11,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:11,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:11,829 INFO L87 Difference]: Start difference. First operand 19329 states and 58275 transitions. Second operand 3 states. [2019-12-18 20:59:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:11,900 INFO L93 Difference]: Finished difference Result 19328 states and 58273 transitions. [2019-12-18 20:59:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:11,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:59:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:11,926 INFO L225 Difference]: With dead ends: 19328 [2019-12-18 20:59:11,926 INFO L226 Difference]: Without dead ends: 19328 [2019-12-18 20:59:11,927 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 20:59:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19328 states. [2019-12-18 20:59:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19328 to 19328. [2019-12-18 20:59:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19328 states. [2019-12-18 20:59:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19328 states to 19328 states and 58273 transitions. [2019-12-18 20:59:12,206 INFO L78 Accepts]: Start accepts. Automaton has 19328 states and 58273 transitions. Word has length 39 [2019-12-18 20:59:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:12,206 INFO L462 AbstractCegarLoop]: Abstraction has 19328 states and 58273 transitions. [2019-12-18 20:59:12,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 19328 states and 58273 transitions. [2019-12-18 20:59:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:59:12,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:12,225 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 20:59:12,226 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 20:59:12,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1687063119, now seen corresponding path program 1 times [2019-12-18 20:59:12,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:12,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095579921] [2019-12-18 20:59:12,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:12,275 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 20:59:12,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095579921] [2019-12-18 20:59:12,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:12,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:59:12,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078831585] [2019-12-18 20:59:12,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:12,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:12,277 INFO L87 Difference]: Start difference. First operand 19328 states and 58273 transitions. Second operand 3 states. [2019-12-18 20:59:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:12,416 INFO L93 Difference]: Finished difference Result 36609 states and 110434 transitions. [2019-12-18 20:59:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:12,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 20:59:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:12,454 INFO L225 Difference]: With dead ends: 36609 [2019-12-18 20:59:12,454 INFO L226 Difference]: Without dead ends: 19756 [2019-12-18 20:59:12,454 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 20:59:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19756 states. [2019-12-18 20:59:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19756 to 19691. [2019-12-18 20:59:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19691 states. [2019-12-18 20:59:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19691 states to 19691 states and 57987 transitions. [2019-12-18 20:59:12,933 INFO L78 Accepts]: Start accepts. Automaton has 19691 states and 57987 transitions. Word has length 40 [2019-12-18 20:59:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:12,934 INFO L462 AbstractCegarLoop]: Abstraction has 19691 states and 57987 transitions. [2019-12-18 20:59:12,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 19691 states and 57987 transitions. [2019-12-18 20:59:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:59:12,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:12,959 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 20:59:12,959 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 20:59:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:12,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1906822553, now seen corresponding path program 2 times [2019-12-18 20:59:12,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:12,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993128401] [2019-12-18 20:59:12,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:13,042 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 20:59:13,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993128401] [2019-12-18 20:59:13,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:13,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:59:13,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296256444] [2019-12-18 20:59:13,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:59:13,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:13,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:59:13,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:59:13,044 INFO L87 Difference]: Start difference. First operand 19691 states and 57987 transitions. Second operand 5 states. [2019-12-18 20:59:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:13,951 INFO L93 Difference]: Finished difference Result 28264 states and 82347 transitions. [2019-12-18 20:59:13,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:59:13,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:59:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:13,990 INFO L225 Difference]: With dead ends: 28264 [2019-12-18 20:59:13,990 INFO L226 Difference]: Without dead ends: 28264 [2019-12-18 20:59:13,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:59:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28264 states. [2019-12-18 20:59:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28264 to 26154. [2019-12-18 20:59:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26154 states. [2019-12-18 20:59:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26154 states to 26154 states and 76703 transitions. [2019-12-18 20:59:14,367 INFO L78 Accepts]: Start accepts. Automaton has 26154 states and 76703 transitions. Word has length 40 [2019-12-18 20:59:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:14,368 INFO L462 AbstractCegarLoop]: Abstraction has 26154 states and 76703 transitions. [2019-12-18 20:59:14,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:59:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 26154 states and 76703 transitions. [2019-12-18 20:59:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:59:14,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:14,391 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 20:59:14,391 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 20:59:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1729290959, now seen corresponding path program 3 times [2019-12-18 20:59:14,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:14,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533705591] [2019-12-18 20:59:14,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:14,454 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 20:59:14,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533705591] [2019-12-18 20:59:14,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:14,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:59:14,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803738776] [2019-12-18 20:59:14,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:59:14,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:14,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:59:14,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:59:14,456 INFO L87 Difference]: Start difference. First operand 26154 states and 76703 transitions. Second operand 5 states. [2019-12-18 20:59:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:14,591 INFO L93 Difference]: Finished difference Result 24768 states and 73560 transitions. [2019-12-18 20:59:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:59:14,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:59:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:14,633 INFO L225 Difference]: With dead ends: 24768 [2019-12-18 20:59:14,633 INFO L226 Difference]: Without dead ends: 23065 [2019-12-18 20:59:14,633 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 20:59:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23065 states. [2019-12-18 20:59:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23065 to 22057. [2019-12-18 20:59:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22057 states. [2019-12-18 20:59:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22057 states to 22057 states and 67239 transitions. [2019-12-18 20:59:15,005 INFO L78 Accepts]: Start accepts. Automaton has 22057 states and 67239 transitions. Word has length 40 [2019-12-18 20:59:15,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:15,006 INFO L462 AbstractCegarLoop]: Abstraction has 22057 states and 67239 transitions. [2019-12-18 20:59:15,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:59:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 22057 states and 67239 transitions. [2019-12-18 20:59:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:59:15,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:15,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:15,029 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 20:59:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1201202062, now seen corresponding path program 1 times [2019-12-18 20:59:15,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:15,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313232723] [2019-12-18 20:59:15,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:15,114 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 20:59:15,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313232723] [2019-12-18 20:59:15,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:15,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:59:15,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804718029] [2019-12-18 20:59:15,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:59:15,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:59:15,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:59:15,116 INFO L87 Difference]: Start difference. First operand 22057 states and 67239 transitions. Second operand 7 states. [2019-12-18 20:59:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:15,596 INFO L93 Difference]: Finished difference Result 65582 states and 197081 transitions. [2019-12-18 20:59:15,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:59:15,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:59:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:15,660 INFO L225 Difference]: With dead ends: 65582 [2019-12-18 20:59:15,660 INFO L226 Difference]: Without dead ends: 45617 [2019-12-18 20:59:15,660 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 20:59:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45617 states. [2019-12-18 20:59:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45617 to 25535. [2019-12-18 20:59:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25535 states. [2019-12-18 20:59:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25535 states to 25535 states and 77618 transitions. [2019-12-18 20:59:16,214 INFO L78 Accepts]: Start accepts. Automaton has 25535 states and 77618 transitions. Word has length 64 [2019-12-18 20:59:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:16,214 INFO L462 AbstractCegarLoop]: Abstraction has 25535 states and 77618 transitions. [2019-12-18 20:59:16,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:59:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 25535 states and 77618 transitions. [2019-12-18 20:59:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:59:16,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:16,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:16,243 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 20:59:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:16,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2018507658, now seen corresponding path program 2 times [2019-12-18 20:59:16,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:16,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494830693] [2019-12-18 20:59:16,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:16,687 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 20:59:16,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494830693] [2019-12-18 20:59:16,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:16,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:59:16,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009170625] [2019-12-18 20:59:16,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:59:16,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:16,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:59:16,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:59:16,690 INFO L87 Difference]: Start difference. First operand 25535 states and 77618 transitions. Second operand 8 states. [2019-12-18 20:59:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:18,001 INFO L93 Difference]: Finished difference Result 95566 states and 286044 transitions. [2019-12-18 20:59:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:59:18,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 20:59:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:18,105 INFO L225 Difference]: With dead ends: 95566 [2019-12-18 20:59:18,105 INFO L226 Difference]: Without dead ends: 70524 [2019-12-18 20:59:18,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:59:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70524 states. [2019-12-18 20:59:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70524 to 28998. [2019-12-18 20:59:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28998 states. [2019-12-18 20:59:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28998 states to 28998 states and 88478 transitions. [2019-12-18 20:59:18,919 INFO L78 Accepts]: Start accepts. Automaton has 28998 states and 88478 transitions. Word has length 64 [2019-12-18 20:59:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:18,919 INFO L462 AbstractCegarLoop]: Abstraction has 28998 states and 88478 transitions. [2019-12-18 20:59:18,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:59:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 28998 states and 88478 transitions. [2019-12-18 20:59:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:59:18,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:18,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:18,952 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 20:59:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:18,952 INFO L82 PathProgramCache]: Analyzing trace with hash -301915694, now seen corresponding path program 3 times [2019-12-18 20:59:18,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:18,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444509791] [2019-12-18 20:59:18,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:59:19,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444509791] [2019-12-18 20:59:19,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:19,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:59:19,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205934318] [2019-12-18 20:59:19,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:59:19,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:59:19,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:59:19,061 INFO L87 Difference]: Start difference. First operand 28998 states and 88478 transitions. Second operand 9 states. [2019-12-18 20:59:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:20,488 INFO L93 Difference]: Finished difference Result 89890 states and 268323 transitions. [2019-12-18 20:59:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:59:20,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 20:59:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:20,614 INFO L225 Difference]: With dead ends: 89890 [2019-12-18 20:59:20,614 INFO L226 Difference]: Without dead ends: 86488 [2019-12-18 20:59:20,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:59:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86488 states. [2019-12-18 20:59:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86488 to 29150. [2019-12-18 20:59:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29150 states. [2019-12-18 20:59:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29150 states to 29150 states and 89009 transitions. [2019-12-18 20:59:21,917 INFO L78 Accepts]: Start accepts. Automaton has 29150 states and 89009 transitions. Word has length 64 [2019-12-18 20:59:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:21,918 INFO L462 AbstractCegarLoop]: Abstraction has 29150 states and 89009 transitions. [2019-12-18 20:59:21,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:59:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 29150 states and 89009 transitions. [2019-12-18 20:59:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:59:21,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:21,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:21,955 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 20:59:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1791657010, now seen corresponding path program 4 times [2019-12-18 20:59:21,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:21,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053613851] [2019-12-18 20:59:21,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:22,078 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 20:59:22,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053613851] [2019-12-18 20:59:22,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:22,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:59:22,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842425859] [2019-12-18 20:59:22,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:59:22,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:22,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:59:22,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:59:22,080 INFO L87 Difference]: Start difference. First operand 29150 states and 89009 transitions. Second operand 9 states. [2019-12-18 20:59:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:23,584 INFO L93 Difference]: Finished difference Result 106763 states and 319187 transitions. [2019-12-18 20:59:23,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:59:23,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 20:59:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:23,740 INFO L225 Difference]: With dead ends: 106763 [2019-12-18 20:59:23,740 INFO L226 Difference]: Without dead ends: 103421 [2019-12-18 20:59:23,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:59:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103421 states. [2019-12-18 20:59:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103421 to 29365. [2019-12-18 20:59:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29365 states. [2019-12-18 20:59:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29365 states to 29365 states and 89874 transitions. [2019-12-18 20:59:25,237 INFO L78 Accepts]: Start accepts. Automaton has 29365 states and 89874 transitions. Word has length 64 [2019-12-18 20:59:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:25,237 INFO L462 AbstractCegarLoop]: Abstraction has 29365 states and 89874 transitions. [2019-12-18 20:59:25,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:59:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 29365 states and 89874 transitions. [2019-12-18 20:59:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:59:25,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:25,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:25,275 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 20:59:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -976809868, now seen corresponding path program 5 times [2019-12-18 20:59:25,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:25,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023547259] [2019-12-18 20:59:25,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:25,364 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 20:59:25,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023547259] [2019-12-18 20:59:25,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:25,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:59:25,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378676992] [2019-12-18 20:59:25,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:59:25,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:25,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:59:25,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:59:25,366 INFO L87 Difference]: Start difference. First operand 29365 states and 89874 transitions. Second operand 7 states. [2019-12-18 20:59:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:25,917 INFO L93 Difference]: Finished difference Result 59807 states and 179941 transitions. [2019-12-18 20:59:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:59:25,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:59:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:25,994 INFO L225 Difference]: With dead ends: 59807 [2019-12-18 20:59:25,994 INFO L226 Difference]: Without dead ends: 52007 [2019-12-18 20:59:25,994 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 20:59:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52007 states. [2019-12-18 20:59:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52007 to 29673. [2019-12-18 20:59:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29673 states. [2019-12-18 20:59:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29673 states to 29673 states and 90825 transitions. [2019-12-18 20:59:26,632 INFO L78 Accepts]: Start accepts. Automaton has 29673 states and 90825 transitions. Word has length 64 [2019-12-18 20:59:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:26,632 INFO L462 AbstractCegarLoop]: Abstraction has 29673 states and 90825 transitions. [2019-12-18 20:59:26,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:59:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 29673 states and 90825 transitions. [2019-12-18 20:59:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:59:26,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:26,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:26,668 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 20:59:26,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash 849800018, now seen corresponding path program 6 times [2019-12-18 20:59:26,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:26,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133480122] [2019-12-18 20:59:26,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:59:26,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133480122] [2019-12-18 20:59:26,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:26,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:59:26,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614795005] [2019-12-18 20:59:26,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:26,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:26,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:26,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:26,731 INFO L87 Difference]: Start difference. First operand 29673 states and 90825 transitions. Second operand 3 states. [2019-12-18 20:59:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:26,897 INFO L93 Difference]: Finished difference Result 34052 states and 103673 transitions. [2019-12-18 20:59:26,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:26,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 20:59:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:26,942 INFO L225 Difference]: With dead ends: 34052 [2019-12-18 20:59:26,943 INFO L226 Difference]: Without dead ends: 34052 [2019-12-18 20:59:26,943 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 20:59:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34052 states. [2019-12-18 20:59:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34052 to 29763. [2019-12-18 20:59:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29763 states. [2019-12-18 20:59:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29763 states to 29763 states and 91188 transitions. [2019-12-18 20:59:27,443 INFO L78 Accepts]: Start accepts. Automaton has 29763 states and 91188 transitions. Word has length 64 [2019-12-18 20:59:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:27,444 INFO L462 AbstractCegarLoop]: Abstraction has 29763 states and 91188 transitions. [2019-12-18 20:59:27,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29763 states and 91188 transitions. [2019-12-18 20:59:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:27,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:27,478 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 20:59:27,478 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 20:59:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1395907049, now seen corresponding path program 1 times [2019-12-18 20:59:27,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:27,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860187472] [2019-12-18 20:59:27,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:27,549 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 20:59:27,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860187472] [2019-12-18 20:59:27,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:27,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:59:27,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536618040] [2019-12-18 20:59:27,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:59:27,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:27,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:59:27,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:59:27,551 INFO L87 Difference]: Start difference. First operand 29763 states and 91188 transitions. Second operand 5 states. [2019-12-18 20:59:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:28,515 INFO L93 Difference]: Finished difference Result 43739 states and 131016 transitions. [2019-12-18 20:59:28,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:59:28,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 20:59:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:28,570 INFO L225 Difference]: With dead ends: 43739 [2019-12-18 20:59:28,570 INFO L226 Difference]: Without dead ends: 43519 [2019-12-18 20:59:28,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:59:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43519 states. [2019-12-18 20:59:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43519 to 34721. [2019-12-18 20:59:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34721 states. [2019-12-18 20:59:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34721 states to 34721 states and 105670 transitions. [2019-12-18 20:59:29,138 INFO L78 Accepts]: Start accepts. Automaton has 34721 states and 105670 transitions. Word has length 65 [2019-12-18 20:59:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:29,138 INFO L462 AbstractCegarLoop]: Abstraction has 34721 states and 105670 transitions. [2019-12-18 20:59:29,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:59:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 34721 states and 105670 transitions. [2019-12-18 20:59:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:29,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:29,178 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 20:59:29,178 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 20:59:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:29,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1599218199, now seen corresponding path program 2 times [2019-12-18 20:59:29,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:29,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347531608] [2019-12-18 20:59:29,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:29,284 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 20:59:29,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347531608] [2019-12-18 20:59:29,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:29,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:59:29,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785152740] [2019-12-18 20:59:29,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:59:29,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:29,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:59:29,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:59:29,286 INFO L87 Difference]: Start difference. First operand 34721 states and 105670 transitions. Second operand 7 states. [2019-12-18 20:59:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:30,758 INFO L93 Difference]: Finished difference Result 70497 states and 209435 transitions. [2019-12-18 20:59:30,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 20:59:30,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 20:59:30,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:30,864 INFO L225 Difference]: With dead ends: 70497 [2019-12-18 20:59:30,864 INFO L226 Difference]: Without dead ends: 70101 [2019-12-18 20:59:30,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:59:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70101 states. [2019-12-18 20:59:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70101 to 39208. [2019-12-18 20:59:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39208 states. [2019-12-18 20:59:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39208 states to 39208 states and 118994 transitions. [2019-12-18 20:59:31,707 INFO L78 Accepts]: Start accepts. Automaton has 39208 states and 118994 transitions. Word has length 65 [2019-12-18 20:59:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:31,707 INFO L462 AbstractCegarLoop]: Abstraction has 39208 states and 118994 transitions. [2019-12-18 20:59:31,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:59:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 39208 states and 118994 transitions. [2019-12-18 20:59:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:31,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:31,746 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 20:59:31,746 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 20:59:31,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash -711424045, now seen corresponding path program 3 times [2019-12-18 20:59:31,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:31,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25734879] [2019-12-18 20:59:31,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:59:31,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25734879] [2019-12-18 20:59:31,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:31,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:59:31,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241113980] [2019-12-18 20:59:31,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:59:31,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:59:31,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:59:31,850 INFO L87 Difference]: Start difference. First operand 39208 states and 118994 transitions. Second operand 7 states. [2019-12-18 20:59:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:34,019 INFO L93 Difference]: Finished difference Result 71618 states and 212527 transitions. [2019-12-18 20:59:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 20:59:34,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 20:59:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:34,134 INFO L225 Difference]: With dead ends: 71618 [2019-12-18 20:59:34,134 INFO L226 Difference]: Without dead ends: 71222 [2019-12-18 20:59:34,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:59:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71222 states. [2019-12-18 20:59:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71222 to 39694. [2019-12-18 20:59:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39694 states. [2019-12-18 20:59:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39694 states to 39694 states and 121068 transitions. [2019-12-18 20:59:35,044 INFO L78 Accepts]: Start accepts. Automaton has 39694 states and 121068 transitions. Word has length 65 [2019-12-18 20:59:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:35,045 INFO L462 AbstractCegarLoop]: Abstraction has 39694 states and 121068 transitions. [2019-12-18 20:59:35,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:59:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 39694 states and 121068 transitions. [2019-12-18 20:59:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:35,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:35,094 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 20:59:35,094 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 20:59:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash 722288833, now seen corresponding path program 4 times [2019-12-18 20:59:35,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:35,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589428675] [2019-12-18 20:59:35,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:59:35,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589428675] [2019-12-18 20:59:35,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:35,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:59:35,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028063000] [2019-12-18 20:59:35,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:59:35,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:35,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:59:35,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:59:35,169 INFO L87 Difference]: Start difference. First operand 39694 states and 121068 transitions. Second operand 6 states. [2019-12-18 20:59:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:35,996 INFO L93 Difference]: Finished difference Result 50385 states and 151119 transitions. [2019-12-18 20:59:35,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:59:35,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 20:59:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:36,070 INFO L225 Difference]: With dead ends: 50385 [2019-12-18 20:59:36,071 INFO L226 Difference]: Without dead ends: 50133 [2019-12-18 20:59:36,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:59:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50133 states. [2019-12-18 20:59:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50133 to 39755. [2019-12-18 20:59:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39755 states. [2019-12-18 20:59:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39755 states to 39755 states and 121231 transitions. [2019-12-18 20:59:37,225 INFO L78 Accepts]: Start accepts. Automaton has 39755 states and 121231 transitions. Word has length 65 [2019-12-18 20:59:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:37,225 INFO L462 AbstractCegarLoop]: Abstraction has 39755 states and 121231 transitions. [2019-12-18 20:59:37,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:59:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 39755 states and 121231 transitions. [2019-12-18 20:59:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:37,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:37,271 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 20:59:37,271 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 20:59:37,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:37,272 INFO L82 PathProgramCache]: Analyzing trace with hash 979279897, now seen corresponding path program 5 times [2019-12-18 20:59:37,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:37,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150951017] [2019-12-18 20:59:37,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:37,399 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 20:59:37,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150951017] [2019-12-18 20:59:37,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:37,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:59:37,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685931645] [2019-12-18 20:59:37,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:59:37,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:37,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:59:37,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:59:37,400 INFO L87 Difference]: Start difference. First operand 39755 states and 121231 transitions. Second operand 8 states. [2019-12-18 20:59:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:39,394 INFO L93 Difference]: Finished difference Result 76782 states and 228669 transitions. [2019-12-18 20:59:39,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:59:39,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 20:59:39,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:39,505 INFO L225 Difference]: With dead ends: 76782 [2019-12-18 20:59:39,505 INFO L226 Difference]: Without dead ends: 76754 [2019-12-18 20:59:39,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:59:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76754 states. [2019-12-18 20:59:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76754 to 37283. [2019-12-18 20:59:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37283 states. [2019-12-18 20:59:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37283 states to 37283 states and 113169 transitions. [2019-12-18 20:59:40,416 INFO L78 Accepts]: Start accepts. Automaton has 37283 states and 113169 transitions. Word has length 65 [2019-12-18 20:59:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:40,416 INFO L462 AbstractCegarLoop]: Abstraction has 37283 states and 113169 transitions. [2019-12-18 20:59:40,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:59:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 37283 states and 113169 transitions. [2019-12-18 20:59:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:40,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:40,460 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 20:59:40,460 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 20:59:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -624886313, now seen corresponding path program 6 times [2019-12-18 20:59:40,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:40,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745309755] [2019-12-18 20:59:40,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:40,634 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 20:59:40,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745309755] [2019-12-18 20:59:40,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:40,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:59:40,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553278971] [2019-12-18 20:59:40,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:59:40,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:40,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:59:40,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:59:40,636 INFO L87 Difference]: Start difference. First operand 37283 states and 113169 transitions. Second operand 10 states. [2019-12-18 20:59:43,688 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-12-18 20:59:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:45,100 INFO L93 Difference]: Finished difference Result 87254 states and 257434 transitions. [2019-12-18 20:59:45,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 20:59:45,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 20:59:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:45,224 INFO L225 Difference]: With dead ends: 87254 [2019-12-18 20:59:45,225 INFO L226 Difference]: Without dead ends: 87254 [2019-12-18 20:59:45,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 20:59:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87254 states. [2019-12-18 20:59:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87254 to 36841. [2019-12-18 20:59:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36841 states. [2019-12-18 20:59:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36841 states to 36841 states and 111814 transitions. [2019-12-18 20:59:46,199 INFO L78 Accepts]: Start accepts. Automaton has 36841 states and 111814 transitions. Word has length 65 [2019-12-18 20:59:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:46,199 INFO L462 AbstractCegarLoop]: Abstraction has 36841 states and 111814 transitions. [2019-12-18 20:59:46,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:59:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 36841 states and 111814 transitions. [2019-12-18 20:59:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:46,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:46,242 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 20:59:46,242 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:59:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1050637071, now seen corresponding path program 7 times [2019-12-18 20:59:46,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:46,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227859132] [2019-12-18 20:59:46,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:46,307 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 20:59:46,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227859132] [2019-12-18 20:59:46,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:46,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:59:46,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448922586] [2019-12-18 20:59:46,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:46,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:46,309 INFO L87 Difference]: Start difference. First operand 36841 states and 111814 transitions. Second operand 3 states. [2019-12-18 20:59:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:46,468 INFO L93 Difference]: Finished difference Result 36841 states and 111813 transitions. [2019-12-18 20:59:46,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:46,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:59:46,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:46,529 INFO L225 Difference]: With dead ends: 36841 [2019-12-18 20:59:46,529 INFO L226 Difference]: Without dead ends: 36841 [2019-12-18 20:59:46,529 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 20:59:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36841 states. [2019-12-18 20:59:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36841 to 28808. [2019-12-18 20:59:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28808 states. [2019-12-18 20:59:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28808 states to 28808 states and 88577 transitions. [2019-12-18 20:59:47,067 INFO L78 Accepts]: Start accepts. Automaton has 28808 states and 88577 transitions. Word has length 65 [2019-12-18 20:59:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:47,067 INFO L462 AbstractCegarLoop]: Abstraction has 28808 states and 88577 transitions. [2019-12-18 20:59:47,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 28808 states and 88577 transitions. [2019-12-18 20:59:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:59:47,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:47,101 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 20:59:47,101 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:59:47,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:47,102 INFO L82 PathProgramCache]: Analyzing trace with hash -479624909, now seen corresponding path program 1 times [2019-12-18 20:59:47,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:47,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82709368] [2019-12-18 20:59:47,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:47,174 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 20:59:47,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82709368] [2019-12-18 20:59:47,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:47,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:59:47,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725606588] [2019-12-18 20:59:47,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:47,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:47,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:47,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:47,177 INFO L87 Difference]: Start difference. First operand 28808 states and 88577 transitions. Second operand 3 states. [2019-12-18 20:59:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:47,270 INFO L93 Difference]: Finished difference Result 21302 states and 64430 transitions. [2019-12-18 20:59:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:47,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:59:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:47,323 INFO L225 Difference]: With dead ends: 21302 [2019-12-18 20:59:47,323 INFO L226 Difference]: Without dead ends: 21302 [2019-12-18 20:59:47,324 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 20:59:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21302 states. [2019-12-18 20:59:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21302 to 20421. [2019-12-18 20:59:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20421 states. [2019-12-18 20:59:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20421 states to 20421 states and 61653 transitions. [2019-12-18 20:59:48,313 INFO L78 Accepts]: Start accepts. Automaton has 20421 states and 61653 transitions. Word has length 66 [2019-12-18 20:59:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:48,314 INFO L462 AbstractCegarLoop]: Abstraction has 20421 states and 61653 transitions. [2019-12-18 20:59:48,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20421 states and 61653 transitions. [2019-12-18 20:59:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:59:48,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:48,343 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 20:59:48,343 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:59:48,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1124784616, now seen corresponding path program 1 times [2019-12-18 20:59:48,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:48,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744224781] [2019-12-18 20:59:48,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:48,530 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 20:59:48,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744224781] [2019-12-18 20:59:48,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:48,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:59:48,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347398659] [2019-12-18 20:59:48,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:59:48,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:48,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:59:48,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:59:48,532 INFO L87 Difference]: Start difference. First operand 20421 states and 61653 transitions. Second operand 10 states. [2019-12-18 20:59:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:49,493 INFO L93 Difference]: Finished difference Result 46862 states and 141881 transitions. [2019-12-18 20:59:49,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 20:59:49,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 20:59:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:49,555 INFO L225 Difference]: With dead ends: 46862 [2019-12-18 20:59:49,555 INFO L226 Difference]: Without dead ends: 44191 [2019-12-18 20:59:49,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-18 20:59:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44191 states. [2019-12-18 20:59:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44191 to 25352. [2019-12-18 20:59:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25352 states. [2019-12-18 20:59:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25352 states to 25352 states and 76631 transitions. [2019-12-18 20:59:50,076 INFO L78 Accepts]: Start accepts. Automaton has 25352 states and 76631 transitions. Word has length 67 [2019-12-18 20:59:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:50,077 INFO L462 AbstractCegarLoop]: Abstraction has 25352 states and 76631 transitions. [2019-12-18 20:59:50,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:59:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 25352 states and 76631 transitions. [2019-12-18 20:59:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:59:50,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:50,106 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 20:59:50,106 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:59:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash -109002058, now seen corresponding path program 2 times [2019-12-18 20:59:50,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:50,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476934614] [2019-12-18 20:59:50,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:50,739 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 20:59:50,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476934614] [2019-12-18 20:59:50,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:50,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 20:59:50,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457464346] [2019-12-18 20:59:50,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 20:59:50,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:50,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 20:59:50,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:59:50,741 INFO L87 Difference]: Start difference. First operand 25352 states and 76631 transitions. Second operand 18 states. [2019-12-18 20:59:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:54,157 INFO L93 Difference]: Finished difference Result 29485 states and 88314 transitions. [2019-12-18 20:59:54,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 20:59:54,157 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 20:59:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:54,199 INFO L225 Difference]: With dead ends: 29485 [2019-12-18 20:59:54,199 INFO L226 Difference]: Without dead ends: 29248 [2019-12-18 20:59:54,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=233, Invalid=1573, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 20:59:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29248 states. [2019-12-18 20:59:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29248 to 25287. [2019-12-18 20:59:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25287 states. [2019-12-18 20:59:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25287 states to 25287 states and 76077 transitions. [2019-12-18 20:59:55,016 INFO L78 Accepts]: Start accepts. Automaton has 25287 states and 76077 transitions. Word has length 67 [2019-12-18 20:59:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:55,016 INFO L462 AbstractCegarLoop]: Abstraction has 25287 states and 76077 transitions. [2019-12-18 20:59:55,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 20:59:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 25287 states and 76077 transitions. [2019-12-18 20:59:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:59:55,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:55,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:55,048 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:59:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:55,049 INFO L82 PathProgramCache]: Analyzing trace with hash 924005430, now seen corresponding path program 3 times [2019-12-18 20:59:55,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:55,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972439155] [2019-12-18 20:59:55,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:55,578 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 20:59:55,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972439155] [2019-12-18 20:59:55,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:55,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 20:59:55,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985304809] [2019-12-18 20:59:55,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 20:59:55,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:55,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 20:59:55,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:59:55,580 INFO L87 Difference]: Start difference. First operand 25287 states and 76077 transitions. Second operand 17 states. [2019-12-18 20:59:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:58,827 INFO L93 Difference]: Finished difference Result 29630 states and 88550 transitions. [2019-12-18 20:59:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 20:59:58,827 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 20:59:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:58,867 INFO L225 Difference]: With dead ends: 29630 [2019-12-18 20:59:58,867 INFO L226 Difference]: Without dead ends: 29235 [2019-12-18 20:59:58,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=230, Invalid=1410, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 20:59:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29235 states. [2019-12-18 20:59:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29235 to 25071. [2019-12-18 20:59:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25071 states. [2019-12-18 20:59:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25071 states to 25071 states and 75513 transitions. [2019-12-18 20:59:59,271 INFO L78 Accepts]: Start accepts. Automaton has 25071 states and 75513 transitions. Word has length 67 [2019-12-18 20:59:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:59,271 INFO L462 AbstractCegarLoop]: Abstraction has 25071 states and 75513 transitions. [2019-12-18 20:59:59,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 20:59:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 25071 states and 75513 transitions. [2019-12-18 20:59:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:59:59,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:59,300 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 20:59:59,301 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:59:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:59,301 INFO L82 PathProgramCache]: Analyzing trace with hash 515359052, now seen corresponding path program 4 times [2019-12-18 20:59:59,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:59,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433532096] [2019-12-18 20:59:59,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:59,493 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 20:59:59,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433532096] [2019-12-18 20:59:59,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:59,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:59:59,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501094438] [2019-12-18 20:59:59,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:59:59,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:59,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:59:59,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:59:59,495 INFO L87 Difference]: Start difference. First operand 25071 states and 75513 transitions. Second operand 10 states. [2019-12-18 21:00:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:00,493 INFO L93 Difference]: Finished difference Result 44699 states and 134093 transitions. [2019-12-18 21:00:00,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:00:00,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 21:00:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:00,547 INFO L225 Difference]: With dead ends: 44699 [2019-12-18 21:00:00,547 INFO L226 Difference]: Without dead ends: 35664 [2019-12-18 21:00:00,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:00:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35664 states. [2019-12-18 21:00:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35664 to 20349. [2019-12-18 21:00:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20349 states. [2019-12-18 21:00:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20349 states to 20349 states and 60852 transitions. [2019-12-18 21:00:00,952 INFO L78 Accepts]: Start accepts. Automaton has 20349 states and 60852 transitions. Word has length 67 [2019-12-18 21:00:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:00,952 INFO L462 AbstractCegarLoop]: Abstraction has 20349 states and 60852 transitions. [2019-12-18 21:00:00,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:00:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 20349 states and 60852 transitions. [2019-12-18 21:00:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:00:00,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:00,972 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:00:00,972 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash -958853246, now seen corresponding path program 5 times [2019-12-18 21:00:00,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:00,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162705226] [2019-12-18 21:00:00,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:01,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:00:01,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162705226] [2019-12-18 21:00:01,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:01,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:00:01,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774658625] [2019-12-18 21:00:01,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:00:01,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:01,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:00:01,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:00:01,170 INFO L87 Difference]: Start difference. First operand 20349 states and 60852 transitions. Second operand 11 states. [2019-12-18 21:00:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:02,209 INFO L93 Difference]: Finished difference Result 39844 states and 119789 transitions. [2019-12-18 21:00:02,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 21:00:02,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:00:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:02,260 INFO L225 Difference]: With dead ends: 39844 [2019-12-18 21:00:02,260 INFO L226 Difference]: Without dead ends: 38465 [2019-12-18 21:00:02,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:00:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38465 states. [2019-12-18 21:00:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38465 to 24189. [2019-12-18 21:00:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24189 states. [2019-12-18 21:00:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24189 states to 24189 states and 72446 transitions. [2019-12-18 21:00:02,970 INFO L78 Accepts]: Start accepts. Automaton has 24189 states and 72446 transitions. Word has length 67 [2019-12-18 21:00:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:02,970 INFO L462 AbstractCegarLoop]: Abstraction has 24189 states and 72446 transitions. [2019-12-18 21:00:02,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:00:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 24189 states and 72446 transitions. [2019-12-18 21:00:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:00:02,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:02,996 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:00:02,997 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2870670, now seen corresponding path program 6 times [2019-12-18 21:00:02,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:02,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282293528] [2019-12-18 21:00:02,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:03,163 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:00:03,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282293528] [2019-12-18 21:00:03,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:03,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:00:03,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677604545] [2019-12-18 21:00:03,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:00:03,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:00:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:00:03,165 INFO L87 Difference]: Start difference. First operand 24189 states and 72446 transitions. Second operand 11 states. [2019-12-18 21:00:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:04,094 INFO L93 Difference]: Finished difference Result 39311 states and 117385 transitions. [2019-12-18 21:00:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 21:00:04,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:00:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:04,141 INFO L225 Difference]: With dead ends: 39311 [2019-12-18 21:00:04,142 INFO L226 Difference]: Without dead ends: 34880 [2019-12-18 21:00:04,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:00:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34880 states. [2019-12-18 21:00:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34880 to 20333. [2019-12-18 21:00:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-18 21:00:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 60631 transitions. [2019-12-18 21:00:04,531 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 60631 transitions. Word has length 67 [2019-12-18 21:00:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:04,532 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 60631 transitions. [2019-12-18 21:00:04,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:00:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 60631 transitions. [2019-12-18 21:00:04,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:00:04,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:04,554 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:00:04,554 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:04,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:04,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1575845586, now seen corresponding path program 7 times [2019-12-18 21:00:04,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:04,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202489004] [2019-12-18 21:00:04,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:04,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202489004] [2019-12-18 21:00:04,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:04,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:00:04,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423706219] [2019-12-18 21:00:04,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:00:04,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:04,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:00:04,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:00:04,713 INFO L87 Difference]: Start difference. First operand 20333 states and 60631 transitions. Second operand 12 states. [2019-12-18 21:00:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:05,747 INFO L93 Difference]: Finished difference Result 35452 states and 105559 transitions. [2019-12-18 21:00:05,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:00:05,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 21:00:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:05,797 INFO L225 Difference]: With dead ends: 35452 [2019-12-18 21:00:05,797 INFO L226 Difference]: Without dead ends: 34450 [2019-12-18 21:00:05,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:00:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34450 states. [2019-12-18 21:00:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34450 to 19671. [2019-12-18 21:00:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19671 states. [2019-12-18 21:00:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19671 states to 19671 states and 58850 transitions. [2019-12-18 21:00:06,179 INFO L78 Accepts]: Start accepts. Automaton has 19671 states and 58850 transitions. Word has length 67 [2019-12-18 21:00:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:06,179 INFO L462 AbstractCegarLoop]: Abstraction has 19671 states and 58850 transitions. [2019-12-18 21:00:06,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:00:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 19671 states and 58850 transitions. [2019-12-18 21:00:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:00:06,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:06,200 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:00:06,200 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:06,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1384479032, now seen corresponding path program 8 times [2019-12-18 21:00:06,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:06,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659196105] [2019-12-18 21:00:06,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:00:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:00:06,293 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:00:06,294 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:00:06,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd0~0_25) (= v_~main$tmp_guard1~0_18 0) (= v_~z$r_buff0_thd3~0_76 0) (= v_~y~0_18 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t745~0.base_23|) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_cnt~0_20) (= v_~z~0_28 0) (= v_~main$tmp_guard0~0_9 0) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= 0 |v_ULTIMATE.start_main_~#t745~0.offset_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t745~0.base_23| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t745~0.base_23|) |v_ULTIMATE.start_main_~#t745~0.offset_19| 0)) |v_#memory_int_15|) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= 0 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~z$w_buff0~0_30) (= v_~__unbuffered_p2_EBX~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$r_buff0_thd0~0_21 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_17) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t745~0.base_23| 1)) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice2~0_35) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t745~0.base_23| 4)) (= v_~x~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t745~0.base_23|) 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0_used~0_117 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_16|, #length=|v_#length_28|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_12|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_26|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ULTIMATE.start_main_~#t745~0.base=|v_ULTIMATE.start_main_~#t745~0.base_23|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_18|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_17|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_76, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_19, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_23|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_12|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~y~0=v_~y~0_18, ULTIMATE.start_main_~#t745~0.offset=|v_ULTIMATE.start_main_~#t745~0.offset_19|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_10|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_117, ~z$w_buff0~0=v_~z$w_buff0~0_30, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t746~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t745~0.base, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t745~0.offset, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t747~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t746~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, ULTIMATE.start_main_~#t747~0.offset, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 21:00:06,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~z$w_buff0~0_17 v_~z$w_buff1~0_17) (= 1 v_~z$w_buff0~0_16) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~z$w_buff0_used~0_89 1) (= (mod v_~z$w_buff1_used~0_57 256) 0) (= v_~z$w_buff0_used~0_90 v_~z$w_buff1_used~0_57) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~z$w_buff1~0=v_~z$w_buff1~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:00:06,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] L823-1-->L825: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t746~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t746~0.base_11|) |v_ULTIMATE.start_main_~#t746~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t746~0.offset_10| 0) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t746~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t746~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t746~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t746~0.offset=|v_ULTIMATE.start_main_~#t746~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t746~0.base=|v_ULTIMATE.start_main_~#t746~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t746~0.offset, #length, ULTIMATE.start_main_~#t746~0.base] because there is no mapped edge [2019-12-18 21:00:06,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L825-1-->L827: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t747~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t747~0.base_10|) |v_ULTIMATE.start_main_~#t747~0.offset_9| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t747~0.base_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t747~0.base_10| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t747~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t747~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t747~0.base=|v_ULTIMATE.start_main_~#t747~0.base_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t747~0.offset=|v_ULTIMATE.start_main_~#t747~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t747~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t747~0.offset, #length] because there is no mapped edge [2019-12-18 21:00:06,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L764-2-->L764-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1094075034 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1094075034 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1094075034| ~z$w_buff1~0_In1094075034) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out1094075034| ~z~0_In1094075034) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1094075034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1094075034, ~z$w_buff1~0=~z$w_buff1~0_In1094075034, ~z~0=~z~0_In1094075034} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1094075034|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1094075034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1094075034, ~z$w_buff1~0=~z$w_buff1~0_In1094075034, ~z~0=~z~0_In1094075034} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 21:00:06,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1437124185 256)))) (or (and (not .cse0) (= ~z$w_buff0~0_In1437124185 |P2Thread1of1ForFork2_#t~ite21_Out1437124185|) (= |P2Thread1of1ForFork2_#t~ite20_In1437124185| |P2Thread1of1ForFork2_#t~ite20_Out1437124185|)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out1437124185| |P2Thread1of1ForFork2_#t~ite21_Out1437124185|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1437124185 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1437124185 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1437124185 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1437124185 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite20_Out1437124185| ~z$w_buff0~0_In1437124185)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1437124185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1437124185, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In1437124185|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1437124185, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437124185, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1437124185, ~weak$$choice2~0=~weak$$choice2~0_In1437124185} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1437124185, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1437124185|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1437124185, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out1437124185|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1437124185, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437124185, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1437124185, ~weak$$choice2~0=~weak$$choice2~0_In1437124185} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 21:00:06,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1411417450 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1411417450 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1411417450| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1411417450| ~z$w_buff0_used~0_In-1411417450) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411417450, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1411417450} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1411417450|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411417450, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1411417450} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:00:06,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1363490041 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1363490041 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1363490041 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1363490041 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1363490041|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1363490041 |P0Thread1of1ForFork0_#t~ite6_Out-1363490041|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1363490041, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1363490041, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1363490041, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1363490041} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1363490041|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1363490041, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1363490041, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1363490041, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1363490041} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:00:06,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-641585055 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-641585055 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-641585055 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out-641585055 ~z$r_buff0_thd1~0_In-641585055) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-641585055, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-641585055} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-641585055, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-641585055|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-641585055} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:00:06,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1357140001 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1357140001 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1357140001 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1357140001 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1357140001|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In1357140001 |P0Thread1of1ForFork0_#t~ite8_Out1357140001|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1357140001, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1357140001, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1357140001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1357140001} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1357140001, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1357140001|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1357140001, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1357140001, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1357140001} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:00:06,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:00:06,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1445849808 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-1445849808| |P2Thread1of1ForFork2_#t~ite23_Out-1445849808|) (= ~z$w_buff1~0_In-1445849808 |P2Thread1of1ForFork2_#t~ite24_Out-1445849808|)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite24_Out-1445849808| |P2Thread1of1ForFork2_#t~ite23_Out-1445849808|) (= ~z$w_buff1~0_In-1445849808 |P2Thread1of1ForFork2_#t~ite23_Out-1445849808|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1445849808 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1445849808 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1445849808 256))) (= 0 (mod ~z$w_buff0_used~0_In-1445849808 256))))))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1445849808|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1445849808, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1445849808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1445849808, ~z$w_buff1~0=~z$w_buff1~0_In-1445849808, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1445849808, ~weak$$choice2~0=~weak$$choice2~0_In-1445849808} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1445849808|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1445849808|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1445849808, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1445849808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1445849808, ~z$w_buff1~0=~z$w_buff1~0_In-1445849808, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1445849808, ~weak$$choice2~0=~weak$$choice2~0_In-1445849808} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 21:00:06,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L791-->L791-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2137902514 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-2137902514| |P2Thread1of1ForFork2_#t~ite26_Out-2137902514|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2137902514 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-2137902514 256)) (and (= (mod ~z$r_buff1_thd3~0_In-2137902514 256) 0) .cse0) (and (= (mod ~z$w_buff1_used~0_In-2137902514 256) 0) .cse0))) (= ~z$w_buff0_used~0_In-2137902514 |P2Thread1of1ForFork2_#t~ite26_Out-2137902514|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite27_Out-2137902514| ~z$w_buff0_used~0_In-2137902514) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite26_In-2137902514| |P2Thread1of1ForFork2_#t~ite26_Out-2137902514|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-2137902514|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137902514, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2137902514, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137902514, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2137902514, ~weak$$choice2~0=~weak$$choice2~0_In-2137902514} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-2137902514|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2137902514, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2137902514, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2137902514, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2137902514, ~weak$$choice2~0=~weak$$choice2~0_In-2137902514, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-2137902514|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 21:00:06,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L793-->L794: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd3~0_65 v_~z$r_buff0_thd3~0_64)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_8|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:00:06,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_16) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 21:00:06,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In852332795 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In852332795 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In852332795 |P1Thread1of1ForFork1_#t~ite11_Out852332795|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out852332795|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In852332795, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In852332795} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In852332795, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out852332795|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In852332795} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:00:06,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In1446003037 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1446003037 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1446003037 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1446003037 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1446003037| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite12_Out1446003037| ~z$w_buff1_used~0_In1446003037)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1446003037, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1446003037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1446003037, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1446003037} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1446003037, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1446003037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1446003037, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1446003037|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1446003037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:00:06,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1915968651 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1915968651 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-1915968651| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1915968651| ~z$r_buff0_thd2~0_In-1915968651)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1915968651, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1915968651} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1915968651, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1915968651|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1915968651} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 21:00:06,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L796-->L800: 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{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:00:06,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L800-2-->L800-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1002817027 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1002817027 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out1002817027| |P2Thread1of1ForFork2_#t~ite39_Out1002817027|))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out1002817027| ~z$w_buff1~0_In1002817027)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out1002817027| ~z~0_In1002817027) (or .cse2 .cse1) .cse0))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1002817027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1002817027, ~z$w_buff1~0=~z$w_buff1~0_In1002817027, ~z~0=~z~0_In1002817027} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1002817027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1002817027, ~z$w_buff1~0=~z$w_buff1~0_In1002817027, ~z~0=~z~0_In1002817027, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1002817027|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1002817027|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 21:00:06,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2121818841 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2121818841 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2121818841 |P2Thread1of1ForFork2_#t~ite40_Out-2121818841|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-2121818841|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2121818841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2121818841} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2121818841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2121818841, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-2121818841|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 21:00:06,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1853296790 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1853296790 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1853296790 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1853296790 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1853296790| ~z$w_buff1_used~0_In-1853296790) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1853296790|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853296790, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1853296790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1853296790, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1853296790} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1853296790|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853296790, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1853296790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1853296790, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1853296790} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 21:00:06,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In459099463 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In459099463 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In459099463 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In459099463 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out459099463| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out459099463| ~z$r_buff1_thd2~0_In459099463)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In459099463, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In459099463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In459099463, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In459099463} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In459099463, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In459099463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In459099463, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out459099463|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In459099463} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:00:06,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-65656275 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-65656275 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-65656275| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-65656275| ~z$r_buff0_thd3~0_In-65656275) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-65656275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-65656275} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-65656275|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-65656275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-65656275} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 21:00:06,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In922138995 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In922138995 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In922138995 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In922138995 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out922138995|)) (and (= ~z$r_buff1_thd3~0_In922138995 |P2Thread1of1ForFork2_#t~ite43_Out922138995|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In922138995, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In922138995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922138995, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In922138995} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In922138995, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In922138995, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out922138995|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922138995, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In922138995} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 21:00:06,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_43) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 21:00:06,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:00:06,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L827-1-->L833: 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:00:06,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L833-2-->L833-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In372029050 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out372029050| |ULTIMATE.start_main_#t~ite47_Out372029050|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In372029050 256)))) (or (and (= ~z~0_In372029050 |ULTIMATE.start_main_#t~ite47_Out372029050|) (or .cse0 .cse1) .cse2) (and (not .cse1) (= ~z$w_buff1~0_In372029050 |ULTIMATE.start_main_#t~ite47_Out372029050|) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In372029050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In372029050, ~z$w_buff1~0=~z$w_buff1~0_In372029050, ~z~0=~z~0_In372029050} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In372029050, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out372029050|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In372029050, ~z$w_buff1~0=~z$w_buff1~0_In372029050, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out372029050|, ~z~0=~z~0_In372029050} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:00:06,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In597187649 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In597187649 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In597187649 |ULTIMATE.start_main_#t~ite49_Out597187649|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out597187649|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In597187649, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597187649} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In597187649, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597187649, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out597187649|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:00:06,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1952993030 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1952993030 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1952993030 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1952993030 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1952993030| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1952993030 |ULTIMATE.start_main_#t~ite50_Out-1952993030|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1952993030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1952993030, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1952993030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952993030} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1952993030|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1952993030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1952993030, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1952993030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952993030} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:00:06,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1693065378 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1693065378 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-1693065378 |ULTIMATE.start_main_#t~ite51_Out-1693065378|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1693065378| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1693065378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693065378} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1693065378, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1693065378|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693065378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:00:06,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In874039932 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In874039932 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In874039932 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In874039932 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out874039932| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out874039932| ~z$r_buff1_thd0~0_In874039932)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In874039932, ~z$w_buff0_used~0=~z$w_buff0_used~0_In874039932, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In874039932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874039932} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out874039932|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In874039932, ~z$w_buff0_used~0=~z$w_buff0_used~0_In874039932, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In874039932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874039932} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:00:06,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite52_13| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~y~0_10 2) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~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_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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:00:06,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:00:06 BasicIcfg [2019-12-18 21:00:06,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:00:06,417 INFO L168 Benchmark]: Toolchain (without parser) took 139855.28 ms. Allocated memory was 142.1 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.1 MB in the beginning and 1.1 GB in the end (delta: -976.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-18 21:00:06,417 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 142.1 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:00:06,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.13 ms. Allocated memory was 142.1 MB in the beginning and 200.3 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 151.8 MB in the end (delta: -52.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:00:06,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 200.3 MB. Free memory was 151.8 MB in the beginning and 149.1 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:00:06,418 INFO L168 Benchmark]: Boogie Preprocessor took 42.78 ms. Allocated memory is still 200.3 MB. Free memory was 149.1 MB in the beginning and 146.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:00:06,418 INFO L168 Benchmark]: RCFGBuilder took 874.83 ms. Allocated memory is still 200.3 MB. Free memory was 146.3 MB in the beginning and 96.2 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:00:06,421 INFO L168 Benchmark]: TraceAbstraction took 138066.09 ms. Allocated memory was 200.3 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 95.5 MB in the beginning and 1.1 GB in the end (delta: -981.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 21:00:06,425 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.18 ms. Allocated memory is still 142.1 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.13 ms. Allocated memory was 142.1 MB in the beginning and 200.3 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 151.8 MB in the end (delta: -52.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 200.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.78 ms. Allocated memory is still 200.3 MB. Free memory was 149.1 MB in the beginning and 146.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.83 ms. Allocated memory is still 200.3 MB. Free memory was 146.3 MB in the beginning and 96.2 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 138066.09 ms. Allocated memory was 200.3 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 95.5 MB in the beginning and 1.1 GB in the end (delta: -981.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 31 ChoiceCompositions, 6479 VarBasedMoverChecksPositive, 196 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 91527 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L744] 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_p2_EAX=0, __unbuffered_p2_EBX=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] [L825] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_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] [L827] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 3 z$flush_delayed = weak$$choice2 [L787] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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_buff1=0, z$w_buff1_used=0] [L788] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L788] 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) [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L789] 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)) [L790] 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)) [L791] 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)) [L792] 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=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=2, y=2, z=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L792] 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)) [L794] 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=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=2, y=2, z=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 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)) [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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=0, 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] [L766] 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 [L800] 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=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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] [L800] 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) [L801] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L802] 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 [L803] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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] [L833] 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) [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 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 [L836] 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 137.7s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 55.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11634 SDtfs, 16482 SDslu, 43334 SDs, 0 SdLazy, 24083 SolverSat, 861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 72 SyntacticMatches, 34 SemanticMatches, 520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164613occurred 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: 50.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 663482 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1937 NumberOfCodeBlocks, 1937 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1831 ConstructedInterpolants, 0 QuantifiedInterpolants, 524137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...