/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 20:07:27,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 20:07:27,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 20:07:27,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 20:07:27,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 20:07:27,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 20:07:27,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 20:07:27,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 20:07:27,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 20:07:27,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 20:07:27,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 20:07:27,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 20:07:27,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 20:07:27,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 20:07:27,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 20:07:27,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 20:07:27,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 20:07:27,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 20:07:27,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 20:07:27,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 20:07:27,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 20:07:27,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 20:07:27,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 20:07:27,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 20:07:27,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 20:07:27,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 20:07:27,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 20:07:27,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 20:07:27,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 20:07:27,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 20:07:27,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 20:07:27,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 20:07:27,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 20:07:27,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 20:07:27,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 20:07:27,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 20:07:27,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 20:07:27,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 20:07:27,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 20:07:27,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 20:07:27,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 20:07:27,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 20:07:27,382 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 20:07:27,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 20:07:27,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 20:07:27,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 20:07:27,384 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 20:07:27,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 20:07:27,385 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 20:07:27,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 20:07:27,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 20:07:27,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 20:07:27,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 20:07:27,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 20:07:27,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 20:07:27,386 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 20:07:27,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 20:07:27,387 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 20:07:27,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 20:07:27,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 20:07:27,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 20:07:27,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 20:07:27,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 20:07:27,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 20:07:27,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 20:07:27,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 20:07:27,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 20:07:27,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 20:07:27,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 20:07:27,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 20:07:27,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 20:07:27,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 20:07:27,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 20:07:27,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 20:07:27,702 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 20:07:27,703 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 20:07:27,703 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2020-10-15 20:07:27,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f611e68b/419d748dc44945a59589f849f2bf0004/FLAG6b2a7909c [2020-10-15 20:07:28,386 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 20:07:28,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2020-10-15 20:07:28,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f611e68b/419d748dc44945a59589f849f2bf0004/FLAG6b2a7909c [2020-10-15 20:07:28,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f611e68b/419d748dc44945a59589f849f2bf0004 [2020-10-15 20:07:28,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 20:07:28,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 20:07:28,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 20:07:28,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 20:07:28,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 20:07:28,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:07:28" (1/1) ... [2020-10-15 20:07:28,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526f0315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:28, skipping insertion in model container [2020-10-15 20:07:28,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:07:28" (1/1) ... [2020-10-15 20:07:28,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 20:07:28,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 20:07:29,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 20:07:29,351 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 20:07:29,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 20:07:29,587 INFO L208 MainTranslator]: Completed translation [2020-10-15 20:07:29,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29 WrapperNode [2020-10-15 20:07:29,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 20:07:29,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 20:07:29,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 20:07:29,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 20:07:29,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (1/1) ... [2020-10-15 20:07:29,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (1/1) ... [2020-10-15 20:07:29,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 20:07:29,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 20:07:29,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 20:07:29,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 20:07:29,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (1/1) ... [2020-10-15 20:07:29,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (1/1) ... [2020-10-15 20:07:29,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (1/1) ... [2020-10-15 20:07:29,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (1/1) ... [2020-10-15 20:07:29,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (1/1) ... [2020-10-15 20:07:29,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (1/1) ... [2020-10-15 20:07:29,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (1/1) ... [2020-10-15 20:07:29,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 20:07:29,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 20:07:29,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 20:07:29,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 20:07:29,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (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 [2020-10-15 20:07:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-15 20:07:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-15 20:07:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-15 20:07:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-15 20:07:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 20:07:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 20:07:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 20:07:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 20:07:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-15 20:07:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-15 20:07:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 20:07:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 20:07:29,803 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 20:07:30,442 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 20:07:30,442 INFO L298 CfgBuilder]: Removed 18 assume(true) statements. [2020-10-15 20:07:30,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:07:30 BoogieIcfgContainer [2020-10-15 20:07:30,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 20:07:30,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 20:07:30,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 20:07:30,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 20:07:30,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 08:07:28" (1/3) ... [2020-10-15 20:07:30,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc64c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:07:30, skipping insertion in model container [2020-10-15 20:07:30,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:07:29" (2/3) ... [2020-10-15 20:07:30,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc64c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:07:30, skipping insertion in model container [2020-10-15 20:07:30,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:07:30" (3/3) ... [2020-10-15 20:07:30,455 INFO L111 eAbstractionObserver]: Analyzing ICFG queue.i [2020-10-15 20:07:30,469 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 20:07:30,469 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 20:07:30,478 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-10-15 20:07:30,479 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 20:07:30,524 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,524 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,525 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,525 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,525 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,525 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,527 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,527 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,529 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,529 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,529 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,529 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,529 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,529 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,530 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,530 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,530 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,530 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,531 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,531 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,531 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,531 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,531 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,532 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,532 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,532 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,532 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,532 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,533 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,533 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,533 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,533 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,534 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,534 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,534 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,534 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,535 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,535 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,535 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,535 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,536 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,536 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,536 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,536 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,537 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,537 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,537 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,537 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,537 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,538 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,538 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,538 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,538 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,539 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,539 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,539 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,539 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,539 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,540 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,540 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,540 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,540 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,541 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,541 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,541 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,541 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,541 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,542 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,542 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,542 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,543 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,543 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,543 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,543 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,544 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,544 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,544 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,544 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,544 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,545 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,545 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,545 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,545 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,546 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,546 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,548 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,548 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,548 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,549 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,549 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,549 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,549 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,549 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,550 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,550 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,553 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,553 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,554 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,562 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,562 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,563 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,563 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,563 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,563 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,564 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,564 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,565 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,565 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,565 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,566 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,566 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,566 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,566 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,567 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,568 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,569 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,569 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,569 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,569 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,570 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,570 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,570 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,570 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,570 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,571 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,571 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,571 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,571 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,571 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,572 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,572 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,572 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,572 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,572 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,573 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,573 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,573 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,573 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,573 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,574 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,574 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,574 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,574 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,574 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,575 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,575 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,575 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,575 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,575 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,576 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,576 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,576 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,576 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,576 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,577 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,577 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,577 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,577 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,578 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,579 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,579 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,579 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,579 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,580 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,580 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,580 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,580 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,581 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,581 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,581 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,581 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,581 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,582 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,582 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,582 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,582 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,582 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,583 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,583 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,583 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,583 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,584 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,584 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,584 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,588 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,588 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,588 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,588 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,589 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,589 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,589 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,589 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,608 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,608 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,609 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,609 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,609 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,609 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,610 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,610 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,610 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,610 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,610 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,610 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,610 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,611 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,611 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,611 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,611 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,611 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,611 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,612 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,612 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,612 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,612 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,612 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,613 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,613 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,613 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,613 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,613 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,613 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,614 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,614 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,617 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,617 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,618 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,618 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,618 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,618 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,618 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,619 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,619 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,620 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,620 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,620 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,620 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,621 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,621 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,621 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,621 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,624 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,624 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,625 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,625 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,625 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,625 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,625 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,625 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,626 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,626 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,627 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,627 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,628 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,628 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,628 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,628 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,628 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,628 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,629 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,629 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,629 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,629 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,629 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,629 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,630 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,630 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,630 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,630 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,630 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,631 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,631 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,631 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,631 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,638 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,638 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,638 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,639 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,639 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,639 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,639 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,640 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,640 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,640 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,641 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,642 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,643 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,643 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,644 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,645 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,645 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,660 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,661 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,661 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,661 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,661 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,661 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,661 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,662 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,662 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,662 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,662 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,662 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,663 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,663 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,663 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,663 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,663 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,663 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,665 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,665 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,665 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,666 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:07:30,689 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 20:07:30,709 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 20:07:30,709 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 20:07:30,709 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 20:07:30,709 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 20:07:30,709 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 20:07:30,709 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 20:07:30,709 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 20:07:30,709 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 20:07:30,727 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 20:07:30,730 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 244 transitions, 510 flow [2020-10-15 20:07:30,733 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 244 transitions, 510 flow [2020-10-15 20:07:30,735 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 234 places, 244 transitions, 510 flow [2020-10-15 20:07:30,831 INFO L129 PetriNetUnfolder]: 16/244 cut-off events. [2020-10-15 20:07:30,831 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-15 20:07:30,843 INFO L80 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 244 events. 16/244 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 381 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 179. Up to 3 conditions per place. [2020-10-15 20:07:30,856 INFO L117 LiptonReduction]: Number of co-enabled transitions 14896 [2020-10-15 20:07:34,630 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2020-10-15 20:07:35,518 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-15 20:07:35,638 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-15 20:07:36,603 WARN L193 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 129 [2020-10-15 20:07:36,906 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-15 20:07:37,887 WARN L193 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 132 [2020-10-15 20:07:38,338 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-15 20:07:38,722 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-15 20:07:39,120 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-15 20:07:40,768 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 152 DAG size of output: 147 [2020-10-15 20:07:41,218 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-10-15 20:07:41,236 INFO L132 LiptonReduction]: Checked pairs total: 39936 [2020-10-15 20:07:41,237 INFO L134 LiptonReduction]: Total number of compositions: 207 [2020-10-15 20:07:41,243 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 72 transitions, 166 flow [2020-10-15 20:07:41,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1165 states. [2020-10-15 20:07:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states. [2020-10-15 20:07:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2020-10-15 20:07:41,340 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:41,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1] [2020-10-15 20:07:41,342 INFO L429 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash 30247, now seen corresponding path program 1 times [2020-10-15 20:07:41,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:41,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818771562] [2020-10-15 20:07:41,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:41,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818771562] [2020-10-15 20:07:41,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:41,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 20:07:41,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186489185] [2020-10-15 20:07:41,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-15 20:07:41,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:41,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-15 20:07:41,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-15 20:07:41,535 INFO L87 Difference]: Start difference. First operand 1165 states. Second operand 2 states. [2020-10-15 20:07:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:41,588 INFO L93 Difference]: Finished difference Result 1163 states and 3076 transitions. [2020-10-15 20:07:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-15 20:07:41,589 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 2 [2020-10-15 20:07:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:41,620 INFO L225 Difference]: With dead ends: 1163 [2020-10-15 20:07:41,621 INFO L226 Difference]: Without dead ends: 1077 [2020-10-15 20:07:41,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-15 20:07:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2020-10-15 20:07:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2020-10-15 20:07:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2020-10-15 20:07:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 2875 transitions. [2020-10-15 20:07:41,760 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 2875 transitions. Word has length 2 [2020-10-15 20:07:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:41,760 INFO L481 AbstractCegarLoop]: Abstraction has 1077 states and 2875 transitions. [2020-10-15 20:07:41,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-15 20:07:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 2875 transitions. [2020-10-15 20:07:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 20:07:41,763 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:41,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:41,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 20:07:41,765 INFO L429 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:41,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:41,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1551148377, now seen corresponding path program 1 times [2020-10-15 20:07:41,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:41,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478601589] [2020-10-15 20:07:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:41,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478601589] [2020-10-15 20:07:41,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:41,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 20:07:41,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167097997] [2020-10-15 20:07:41,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 20:07:41,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 20:07:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 20:07:41,899 INFO L87 Difference]: Start difference. First operand 1077 states and 2875 transitions. Second operand 3 states. [2020-10-15 20:07:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:41,923 INFO L93 Difference]: Finished difference Result 1077 states and 2838 transitions. [2020-10-15 20:07:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 20:07:41,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 20:07:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:41,932 INFO L225 Difference]: With dead ends: 1077 [2020-10-15 20:07:41,932 INFO L226 Difference]: Without dead ends: 1077 [2020-10-15 20:07:41,933 INFO L677 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 [2020-10-15 20:07:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2020-10-15 20:07:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2020-10-15 20:07:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2020-10-15 20:07:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 2838 transitions. [2020-10-15 20:07:41,971 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 2838 transitions. Word has length 11 [2020-10-15 20:07:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:41,971 INFO L481 AbstractCegarLoop]: Abstraction has 1077 states and 2838 transitions. [2020-10-15 20:07:41,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 20:07:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 2838 transitions. [2020-10-15 20:07:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 20:07:41,974 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:41,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:41,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 20:07:41,974 INFO L429 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash 304222627, now seen corresponding path program 1 times [2020-10-15 20:07:41,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:41,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532530875] [2020-10-15 20:07:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:42,350 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2020-10-15 20:07:42,478 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-10-15 20:07:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:42,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532530875] [2020-10-15 20:07:42,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:42,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 20:07:42,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118818223] [2020-10-15 20:07:42,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 20:07:42,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:42,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 20:07:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 20:07:42,550 INFO L87 Difference]: Start difference. First operand 1077 states and 2838 transitions. Second operand 6 states. [2020-10-15 20:07:42,820 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 20:07:43,158 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-15 20:07:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:43,647 INFO L93 Difference]: Finished difference Result 1076 states and 2835 transitions. [2020-10-15 20:07:43,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 20:07:43,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-15 20:07:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:43,658 INFO L225 Difference]: With dead ends: 1076 [2020-10-15 20:07:43,658 INFO L226 Difference]: Without dead ends: 1076 [2020-10-15 20:07:43,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:07:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2020-10-15 20:07:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2020-10-15 20:07:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2020-10-15 20:07:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2835 transitions. [2020-10-15 20:07:43,699 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2835 transitions. Word has length 13 [2020-10-15 20:07:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:43,700 INFO L481 AbstractCegarLoop]: Abstraction has 1076 states and 2835 transitions. [2020-10-15 20:07:43,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 20:07:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2835 transitions. [2020-10-15 20:07:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 20:07:43,711 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:43,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:43,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 20:07:43,712 INFO L429 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2053158153, now seen corresponding path program 1 times [2020-10-15 20:07:43,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:43,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541959366] [2020-10-15 20:07:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:43,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541959366] [2020-10-15 20:07:43,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:43,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 20:07:43,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786155650] [2020-10-15 20:07:43,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 20:07:43,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:43,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 20:07:43,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 20:07:43,825 INFO L87 Difference]: Start difference. First operand 1076 states and 2835 transitions. Second operand 3 states. [2020-10-15 20:07:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:43,857 INFO L93 Difference]: Finished difference Result 941 states and 2417 transitions. [2020-10-15 20:07:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 20:07:43,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 20:07:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:43,864 INFO L225 Difference]: With dead ends: 941 [2020-10-15 20:07:43,864 INFO L226 Difference]: Without dead ends: 909 [2020-10-15 20:07:43,865 INFO L677 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 [2020-10-15 20:07:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2020-10-15 20:07:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2020-10-15 20:07:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2020-10-15 20:07:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 2342 transitions. [2020-10-15 20:07:43,902 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 2342 transitions. Word has length 13 [2020-10-15 20:07:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:43,904 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 2342 transitions. [2020-10-15 20:07:43,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 20:07:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 2342 transitions. [2020-10-15 20:07:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 20:07:43,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:43,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:43,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 20:07:43,905 INFO L429 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:43,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1470878311, now seen corresponding path program 1 times [2020-10-15 20:07:43,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:43,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900338758] [2020-10-15 20:07:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:44,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900338758] [2020-10-15 20:07:44,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:44,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 20:07:44,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292794660] [2020-10-15 20:07:44,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 20:07:44,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 20:07:44,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 20:07:44,119 INFO L87 Difference]: Start difference. First operand 909 states and 2342 transitions. Second operand 7 states. [2020-10-15 20:07:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:44,438 INFO L93 Difference]: Finished difference Result 993 states and 2540 transitions. [2020-10-15 20:07:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 20:07:44,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-15 20:07:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:44,447 INFO L225 Difference]: With dead ends: 993 [2020-10-15 20:07:44,447 INFO L226 Difference]: Without dead ends: 993 [2020-10-15 20:07:44,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:07:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-10-15 20:07:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 965. [2020-10-15 20:07:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2020-10-15 20:07:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 2474 transitions. [2020-10-15 20:07:44,477 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 2474 transitions. Word has length 14 [2020-10-15 20:07:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:44,478 INFO L481 AbstractCegarLoop]: Abstraction has 965 states and 2474 transitions. [2020-10-15 20:07:44,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 20:07:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 2474 transitions. [2020-10-15 20:07:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 20:07:44,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:44,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:44,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 20:07:44,479 INFO L429 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash -69142429, now seen corresponding path program 2 times [2020-10-15 20:07:44,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:44,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141822790] [2020-10-15 20:07:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:44,748 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2020-10-15 20:07:44,882 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-10-15 20:07:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:45,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141822790] [2020-10-15 20:07:45,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:45,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 20:07:45,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839754778] [2020-10-15 20:07:45,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 20:07:45,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:45,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 20:07:45,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 20:07:45,052 INFO L87 Difference]: Start difference. First operand 965 states and 2474 transitions. Second operand 7 states. [2020-10-15 20:07:45,274 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-15 20:07:45,530 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-15 20:07:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:46,109 INFO L93 Difference]: Finished difference Result 1035 states and 2639 transitions. [2020-10-15 20:07:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 20:07:46,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-15 20:07:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:46,120 INFO L225 Difference]: With dead ends: 1035 [2020-10-15 20:07:46,120 INFO L226 Difference]: Without dead ends: 1035 [2020-10-15 20:07:46,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:07:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2020-10-15 20:07:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 951. [2020-10-15 20:07:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2020-10-15 20:07:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2441 transitions. [2020-10-15 20:07:46,146 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2441 transitions. Word has length 14 [2020-10-15 20:07:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:46,147 INFO L481 AbstractCegarLoop]: Abstraction has 951 states and 2441 transitions. [2020-10-15 20:07:46,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 20:07:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2441 transitions. [2020-10-15 20:07:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 20:07:46,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:46,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:46,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 20:07:46,148 INFO L429 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1011820279, now seen corresponding path program 3 times [2020-10-15 20:07:46,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:46,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153494813] [2020-10-15 20:07:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:46,334 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2020-10-15 20:07:46,464 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-10-15 20:07:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:46,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153494813] [2020-10-15 20:07:46,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:46,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 20:07:46,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415367406] [2020-10-15 20:07:46,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 20:07:46,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:46,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 20:07:46,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 20:07:46,577 INFO L87 Difference]: Start difference. First operand 951 states and 2441 transitions. Second operand 7 states. [2020-10-15 20:07:46,796 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-10-15 20:07:47,013 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-15 20:07:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:47,509 INFO L93 Difference]: Finished difference Result 937 states and 2394 transitions. [2020-10-15 20:07:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 20:07:47,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-15 20:07:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:47,516 INFO L225 Difference]: With dead ends: 937 [2020-10-15 20:07:47,516 INFO L226 Difference]: Without dead ends: 937 [2020-10-15 20:07:47,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:07:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2020-10-15 20:07:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 895. [2020-10-15 20:07:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2020-10-15 20:07:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2295 transitions. [2020-10-15 20:07:47,540 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2295 transitions. Word has length 14 [2020-10-15 20:07:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:47,540 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 2295 transitions. [2020-10-15 20:07:47,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 20:07:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2295 transitions. [2020-10-15 20:07:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 20:07:47,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:47,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:47,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 20:07:47,542 INFO L429 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:47,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:47,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1520950043, now seen corresponding path program 1 times [2020-10-15 20:07:47,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:47,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894141514] [2020-10-15 20:07:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:47,762 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-10-15 20:07:47,943 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2020-10-15 20:07:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:48,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894141514] [2020-10-15 20:07:48,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:48,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:07:48,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92114100] [2020-10-15 20:07:48,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:07:48,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:48,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:07:48,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:07:48,249 INFO L87 Difference]: Start difference. First operand 895 states and 2295 transitions. Second operand 10 states. [2020-10-15 20:07:48,636 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2020-10-15 20:07:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:49,153 INFO L93 Difference]: Finished difference Result 893 states and 2291 transitions. [2020-10-15 20:07:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:07:49,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-10-15 20:07:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:49,160 INFO L225 Difference]: With dead ends: 893 [2020-10-15 20:07:49,160 INFO L226 Difference]: Without dead ends: 893 [2020-10-15 20:07:49,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-10-15 20:07:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2020-10-15 20:07:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2020-10-15 20:07:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2020-10-15 20:07:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 2291 transitions. [2020-10-15 20:07:49,181 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 2291 transitions. Word has length 14 [2020-10-15 20:07:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:49,181 INFO L481 AbstractCegarLoop]: Abstraction has 893 states and 2291 transitions. [2020-10-15 20:07:49,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:07:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 2291 transitions. [2020-10-15 20:07:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 20:07:49,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:49,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:49,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 20:07:49,183 INFO L429 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:49,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1967571483, now seen corresponding path program 1 times [2020-10-15 20:07:49,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:49,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146298582] [2020-10-15 20:07:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:49,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146298582] [2020-10-15 20:07:49,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:49,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 20:07:49,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833209946] [2020-10-15 20:07:49,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 20:07:49,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 20:07:49,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-15 20:07:49,542 INFO L87 Difference]: Start difference. First operand 893 states and 2291 transitions. Second operand 11 states. [2020-10-15 20:07:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:50,236 INFO L93 Difference]: Finished difference Result 989 states and 2526 transitions. [2020-10-15 20:07:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:07:50,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2020-10-15 20:07:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:50,241 INFO L225 Difference]: With dead ends: 989 [2020-10-15 20:07:50,241 INFO L226 Difference]: Without dead ends: 934 [2020-10-15 20:07:50,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-15 20:07:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2020-10-15 20:07:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 880. [2020-10-15 20:07:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-10-15 20:07:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2269 transitions. [2020-10-15 20:07:50,262 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2269 transitions. Word has length 15 [2020-10-15 20:07:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:50,262 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 2269 transitions. [2020-10-15 20:07:50,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 20:07:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2269 transitions. [2020-10-15 20:07:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 20:07:50,263 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:50,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:50,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 20:07:50,264 INFO L429 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash -188053239, now seen corresponding path program 2 times [2020-10-15 20:07:50,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:50,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617489929] [2020-10-15 20:07:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:50,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617489929] [2020-10-15 20:07:50,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:50,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 20:07:50,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670016925] [2020-10-15 20:07:50,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 20:07:50,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:50,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 20:07:50,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-15 20:07:50,598 INFO L87 Difference]: Start difference. First operand 880 states and 2269 transitions. Second operand 11 states. [2020-10-15 20:07:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:51,246 INFO L93 Difference]: Finished difference Result 992 states and 2552 transitions. [2020-10-15 20:07:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:07:51,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2020-10-15 20:07:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:51,253 INFO L225 Difference]: With dead ends: 992 [2020-10-15 20:07:51,253 INFO L226 Difference]: Without dead ends: 977 [2020-10-15 20:07:51,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-10-15 20:07:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2020-10-15 20:07:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 866. [2020-10-15 20:07:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2020-10-15 20:07:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2236 transitions. [2020-10-15 20:07:51,276 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 2236 transitions. Word has length 15 [2020-10-15 20:07:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:51,277 INFO L481 AbstractCegarLoop]: Abstraction has 866 states and 2236 transitions. [2020-10-15 20:07:51,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 20:07:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 2236 transitions. [2020-10-15 20:07:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 20:07:51,277 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:51,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:51,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 20:07:51,278 INFO L429 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash -96892779, now seen corresponding path program 3 times [2020-10-15 20:07:51,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:51,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635155344] [2020-10-15 20:07:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:07:51,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635155344] [2020-10-15 20:07:51,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:07:51,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 20:07:51,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359674589] [2020-10-15 20:07:51,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 20:07:51,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:07:51,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 20:07:51,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-15 20:07:51,649 INFO L87 Difference]: Start difference. First operand 866 states and 2236 transitions. Second operand 11 states. [2020-10-15 20:07:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:07:52,237 INFO L93 Difference]: Finished difference Result 910 states and 2345 transitions. [2020-10-15 20:07:52,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:07:52,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2020-10-15 20:07:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:07:52,242 INFO L225 Difference]: With dead ends: 910 [2020-10-15 20:07:52,242 INFO L226 Difference]: Without dead ends: 900 [2020-10-15 20:07:52,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-10-15 20:07:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-10-15 20:07:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 852. [2020-10-15 20:07:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-10-15 20:07:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2203 transitions. [2020-10-15 20:07:52,263 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2203 transitions. Word has length 15 [2020-10-15 20:07:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:07:52,263 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 2203 transitions. [2020-10-15 20:07:52,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 20:07:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2203 transitions. [2020-10-15 20:07:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 20:07:52,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:07:52,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:07:52,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 20:07:52,264 INFO L429 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:07:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:07:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash -95278299, now seen corresponding path program 4 times [2020-10-15 20:07:52,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:07:52,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702553824] [2020-10-15 20:07:52,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:07:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:07:56,347 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-10-15 20:07:56,776 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2020-10-15 20:07:57,039 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 43 [2020-10-15 20:07:57,419 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2020-10-15 20:07:58,088 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2020-10-15 20:07:58,940 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2020-10-15 20:07:59,688 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2020-10-15 20:08:00,272 WARN L193 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-10-15 20:08:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:00,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702553824] [2020-10-15 20:08:00,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:00,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 20:08:00,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296581550] [2020-10-15 20:08:00,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 20:08:00,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 20:08:00,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:08:00,453 INFO L87 Difference]: Start difference. First operand 852 states and 2203 transitions. Second operand 12 states. [2020-10-15 20:08:00,952 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2020-10-15 20:08:03,240 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-15 20:08:07,285 WARN L193 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 103 [2020-10-15 20:08:12,911 WARN L193 SmtUtils]: Spent 3.55 s on a formula simplification that was a NOOP. DAG size: 115 [2020-10-15 20:08:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:19,211 INFO L93 Difference]: Finished difference Result 854 states and 2218 transitions. [2020-10-15 20:08:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 20:08:19,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-15 20:08:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:19,217 INFO L225 Difference]: With dead ends: 854 [2020-10-15 20:08:19,217 INFO L226 Difference]: Without dead ends: 849 [2020-10-15 20:08:19,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-10-15 20:08:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2020-10-15 20:08:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 810. [2020-10-15 20:08:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-10-15 20:08:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 2109 transitions. [2020-10-15 20:08:19,234 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 2109 transitions. Word has length 15 [2020-10-15 20:08:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:19,235 INFO L481 AbstractCegarLoop]: Abstraction has 810 states and 2109 transitions. [2020-10-15 20:08:19,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 20:08:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 2109 transitions. [2020-10-15 20:08:19,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-15 20:08:19,237 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:19,237 INFO L422 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] [2020-10-15 20:08:19,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 20:08:19,237 INFO L429 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:19,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:19,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1510697184, now seen corresponding path program 1 times [2020-10-15 20:08:19,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:19,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978673583] [2020-10-15 20:08:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:19,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978673583] [2020-10-15 20:08:19,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:19,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 20:08:19,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204592674] [2020-10-15 20:08:19,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 20:08:19,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:19,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 20:08:19,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 20:08:19,271 INFO L87 Difference]: Start difference. First operand 810 states and 2109 transitions. Second operand 3 states. [2020-10-15 20:08:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:19,312 INFO L93 Difference]: Finished difference Result 373 states and 802 transitions. [2020-10-15 20:08:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 20:08:19,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-15 20:08:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:19,315 INFO L225 Difference]: With dead ends: 373 [2020-10-15 20:08:19,315 INFO L226 Difference]: Without dead ends: 367 [2020-10-15 20:08:19,315 INFO L677 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 [2020-10-15 20:08:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2020-10-15 20:08:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 301. [2020-10-15 20:08:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-10-15 20:08:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 653 transitions. [2020-10-15 20:08:19,322 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 653 transitions. Word has length 35 [2020-10-15 20:08:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:19,322 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 653 transitions. [2020-10-15 20:08:19,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 20:08:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 653 transitions. [2020-10-15 20:08:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-15 20:08:19,324 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:19,324 INFO L422 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] [2020-10-15 20:08:19,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 20:08:19,324 INFO L429 AbstractCegarLoop]: === Iteration 14 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:19,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1665489794, now seen corresponding path program 1 times [2020-10-15 20:08:19,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:19,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376874627] [2020-10-15 20:08:19,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:19,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376874627] [2020-10-15 20:08:19,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:19,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 20:08:19,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226874160] [2020-10-15 20:08:19,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-15 20:08:19,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:19,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-15 20:08:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-15 20:08:19,793 INFO L87 Difference]: Start difference. First operand 301 states and 653 transitions. Second operand 13 states. [2020-10-15 20:08:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:20,598 INFO L93 Difference]: Finished difference Result 352 states and 758 transitions. [2020-10-15 20:08:20,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 20:08:20,599 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2020-10-15 20:08:20,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:20,602 INFO L225 Difference]: With dead ends: 352 [2020-10-15 20:08:20,602 INFO L226 Difference]: Without dead ends: 352 [2020-10-15 20:08:20,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2020-10-15 20:08:20,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-10-15 20:08:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 341. [2020-10-15 20:08:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-10-15 20:08:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 736 transitions. [2020-10-15 20:08:20,609 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 736 transitions. Word has length 36 [2020-10-15 20:08:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:20,610 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 736 transitions. [2020-10-15 20:08:20,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-15 20:08:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 736 transitions. [2020-10-15 20:08:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-15 20:08:20,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:20,611 INFO L422 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] [2020-10-15 20:08:20,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 20:08:20,612 INFO L429 AbstractCegarLoop]: === Iteration 15 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:20,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1970428694, now seen corresponding path program 2 times [2020-10-15 20:08:20,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:20,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767739513] [2020-10-15 20:08:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:20,936 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-10-15 20:08:21,240 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-10-15 20:08:21,404 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 29 [2020-10-15 20:08:21,526 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2020-10-15 20:08:21,709 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-10-15 20:08:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:22,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767739513] [2020-10-15 20:08:22,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:22,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-15 20:08:22,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829205240] [2020-10-15 20:08:22,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-15 20:08:22,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-15 20:08:22,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2020-10-15 20:08:22,237 INFO L87 Difference]: Start difference. First operand 341 states and 736 transitions. Second operand 17 states. [2020-10-15 20:08:22,711 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-15 20:08:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:24,230 INFO L93 Difference]: Finished difference Result 646 states and 1410 transitions. [2020-10-15 20:08:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-15 20:08:24,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2020-10-15 20:08:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:24,235 INFO L225 Difference]: With dead ends: 646 [2020-10-15 20:08:24,235 INFO L226 Difference]: Without dead ends: 628 [2020-10-15 20:08:24,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2020-10-15 20:08:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-10-15 20:08:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 519. [2020-10-15 20:08:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2020-10-15 20:08:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1144 transitions. [2020-10-15 20:08:24,246 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1144 transitions. Word has length 36 [2020-10-15 20:08:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:24,246 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 1144 transitions. [2020-10-15 20:08:24,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-15 20:08:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1144 transitions. [2020-10-15 20:08:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-15 20:08:24,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:24,248 INFO L422 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] [2020-10-15 20:08:24,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 20:08:24,249 INFO L429 AbstractCegarLoop]: === Iteration 16 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:24,249 INFO L82 PathProgramCache]: Analyzing trace with hash -951990606, now seen corresponding path program 1 times [2020-10-15 20:08:24,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:24,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730429823] [2020-10-15 20:08:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:24,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730429823] [2020-10-15 20:08:24,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:24,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 20:08:24,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755378825] [2020-10-15 20:08:24,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-15 20:08:24,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:24,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-15 20:08:24,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-10-15 20:08:24,668 INFO L87 Difference]: Start difference. First operand 519 states and 1144 transitions. Second operand 13 states. [2020-10-15 20:08:25,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:25,347 INFO L93 Difference]: Finished difference Result 481 states and 1043 transitions. [2020-10-15 20:08:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 20:08:25,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-10-15 20:08:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:25,350 INFO L225 Difference]: With dead ends: 481 [2020-10-15 20:08:25,350 INFO L226 Difference]: Without dead ends: 481 [2020-10-15 20:08:25,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-10-15 20:08:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-10-15 20:08:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 455. [2020-10-15 20:08:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-15 20:08:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 991 transitions. [2020-10-15 20:08:25,360 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 991 transitions. Word has length 37 [2020-10-15 20:08:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:25,361 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 991 transitions. [2020-10-15 20:08:25,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-15 20:08:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 991 transitions. [2020-10-15 20:08:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:08:25,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:25,362 INFO L422 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] [2020-10-15 20:08:25,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 20:08:25,362 INFO L429 AbstractCegarLoop]: === Iteration 17 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2126544081, now seen corresponding path program 1 times [2020-10-15 20:08:25,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:25,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663193980] [2020-10-15 20:08:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:25,720 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 34 [2020-10-15 20:08:26,515 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-15 20:08:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:27,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663193980] [2020-10-15 20:08:27,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:27,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:08:27,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954810697] [2020-10-15 20:08:27,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:08:27,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:27,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:08:27,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:08:27,241 INFO L87 Difference]: Start difference. First operand 455 states and 991 transitions. Second operand 21 states. [2020-10-15 20:08:29,071 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-10-15 20:08:30,681 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-15 20:08:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:31,188 INFO L93 Difference]: Finished difference Result 639 states and 1368 transitions. [2020-10-15 20:08:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-15 20:08:31,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:08:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:31,193 INFO L225 Difference]: With dead ends: 639 [2020-10-15 20:08:31,193 INFO L226 Difference]: Without dead ends: 599 [2020-10-15 20:08:31,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2020-10-15 20:08:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-10-15 20:08:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 538. [2020-10-15 20:08:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-10-15 20:08:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1149 transitions. [2020-10-15 20:08:31,204 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1149 transitions. Word has length 38 [2020-10-15 20:08:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:31,204 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 1149 transitions. [2020-10-15 20:08:31,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:08:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1149 transitions. [2020-10-15 20:08:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:08:31,206 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:31,206 INFO L422 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] [2020-10-15 20:08:31,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 20:08:31,206 INFO L429 AbstractCegarLoop]: === Iteration 18 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:31,207 INFO L82 PathProgramCache]: Analyzing trace with hash 584043011, now seen corresponding path program 2 times [2020-10-15 20:08:31,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:31,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666445930] [2020-10-15 20:08:31,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:32,148 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-15 20:08:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:32,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666445930] [2020-10-15 20:08:32,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:32,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:08:32,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622334122] [2020-10-15 20:08:32,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:08:32,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:32,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:08:32,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:08:32,937 INFO L87 Difference]: Start difference. First operand 538 states and 1149 transitions. Second operand 21 states. [2020-10-15 20:08:34,666 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-10-15 20:08:36,380 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-15 20:08:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:36,916 INFO L93 Difference]: Finished difference Result 772 states and 1640 transitions. [2020-10-15 20:08:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-15 20:08:36,917 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:08:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:36,920 INFO L225 Difference]: With dead ends: 772 [2020-10-15 20:08:36,920 INFO L226 Difference]: Without dead ends: 732 [2020-10-15 20:08:36,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=196, Invalid=1286, Unknown=0, NotChecked=0, Total=1482 [2020-10-15 20:08:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-10-15 20:08:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 541. [2020-10-15 20:08:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-10-15 20:08:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1156 transitions. [2020-10-15 20:08:36,931 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1156 transitions. Word has length 38 [2020-10-15 20:08:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:36,931 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 1156 transitions. [2020-10-15 20:08:36,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:08:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1156 transitions. [2020-10-15 20:08:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:08:36,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:36,933 INFO L422 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] [2020-10-15 20:08:36,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 20:08:36,933 INFO L429 AbstractCegarLoop]: === Iteration 19 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash -672100925, now seen corresponding path program 3 times [2020-10-15 20:08:36,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:36,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501957929] [2020-10-15 20:08:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:37,820 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-15 20:08:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:38,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501957929] [2020-10-15 20:08:38,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:38,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:08:38,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105504941] [2020-10-15 20:08:38,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:08:38,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:38,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:08:38,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:08:38,513 INFO L87 Difference]: Start difference. First operand 541 states and 1156 transitions. Second operand 21 states. [2020-10-15 20:08:40,364 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-10-15 20:08:42,053 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-15 20:08:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:42,612 INFO L93 Difference]: Finished difference Result 757 states and 1612 transitions. [2020-10-15 20:08:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-15 20:08:42,614 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:08:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:42,618 INFO L225 Difference]: With dead ends: 757 [2020-10-15 20:08:42,618 INFO L226 Difference]: Without dead ends: 717 [2020-10-15 20:08:42,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2020-10-15 20:08:42,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2020-10-15 20:08:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 550. [2020-10-15 20:08:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-10-15 20:08:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1177 transitions. [2020-10-15 20:08:42,628 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1177 transitions. Word has length 38 [2020-10-15 20:08:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:42,629 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1177 transitions. [2020-10-15 20:08:42,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:08:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1177 transitions. [2020-10-15 20:08:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:08:42,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:42,630 INFO L422 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] [2020-10-15 20:08:42,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 20:08:42,630 INFO L429 AbstractCegarLoop]: === Iteration 20 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash -588198373, now seen corresponding path program 4 times [2020-10-15 20:08:42,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:42,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902328276] [2020-10-15 20:08:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:42,999 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2020-10-15 20:08:43,121 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2020-10-15 20:08:43,754 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-15 20:08:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:44,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902328276] [2020-10-15 20:08:44,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:44,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:08:44,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523505634] [2020-10-15 20:08:44,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:08:44,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:08:44,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:08:44,527 INFO L87 Difference]: Start difference. First operand 550 states and 1177 transitions. Second operand 21 states. [2020-10-15 20:08:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:48,509 INFO L93 Difference]: Finished difference Result 956 states and 2045 transitions. [2020-10-15 20:08:48,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-15 20:08:48,510 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:08:48,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:48,514 INFO L225 Difference]: With dead ends: 956 [2020-10-15 20:08:48,514 INFO L226 Difference]: Without dead ends: 916 [2020-10-15 20:08:48,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2020-10-15 20:08:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2020-10-15 20:08:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 589. [2020-10-15 20:08:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-10-15 20:08:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1271 transitions. [2020-10-15 20:08:48,527 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1271 transitions. Word has length 38 [2020-10-15 20:08:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:48,527 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 1271 transitions. [2020-10-15 20:08:48,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:08:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1271 transitions. [2020-10-15 20:08:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:08:48,529 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:48,529 INFO L422 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] [2020-10-15 20:08:48,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 20:08:48,529 INFO L429 AbstractCegarLoop]: === Iteration 21 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:48,530 INFO L82 PathProgramCache]: Analyzing trace with hash 297208907, now seen corresponding path program 5 times [2020-10-15 20:08:48,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:48,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823612135] [2020-10-15 20:08:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:49,571 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2020-10-15 20:08:49,811 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-15 20:08:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:50,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823612135] [2020-10-15 20:08:50,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:50,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:08:50,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939895367] [2020-10-15 20:08:50,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:08:50,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:50,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:08:50,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:08:50,534 INFO L87 Difference]: Start difference. First operand 589 states and 1271 transitions. Second operand 21 states. [2020-10-15 20:08:52,300 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-10-15 20:08:54,034 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-15 20:08:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:08:54,593 INFO L93 Difference]: Finished difference Result 763 states and 1633 transitions. [2020-10-15 20:08:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-15 20:08:54,594 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:08:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:08:54,598 INFO L225 Difference]: With dead ends: 763 [2020-10-15 20:08:54,599 INFO L226 Difference]: Without dead ends: 723 [2020-10-15 20:08:54,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2020-10-15 20:08:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-10-15 20:08:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 589. [2020-10-15 20:08:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-10-15 20:08:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1271 transitions. [2020-10-15 20:08:54,609 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1271 transitions. Word has length 38 [2020-10-15 20:08:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:08:54,609 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 1271 transitions. [2020-10-15 20:08:54,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:08:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1271 transitions. [2020-10-15 20:08:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:08:54,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:08:54,611 INFO L422 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] [2020-10-15 20:08:54,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 20:08:54,611 INFO L429 AbstractCegarLoop]: === Iteration 22 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:08:54,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:08:54,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2038336537, now seen corresponding path program 6 times [2020-10-15 20:08:54,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:08:54,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362791083] [2020-10-15 20:08:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:08:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:08:54,910 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 34 [2020-10-15 20:08:55,035 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-10-15 20:08:55,621 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-15 20:08:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:08:56,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362791083] [2020-10-15 20:08:56,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:08:56,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:08:56,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621678726] [2020-10-15 20:08:56,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:08:56,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:08:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:08:56,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:08:56,302 INFO L87 Difference]: Start difference. First operand 589 states and 1271 transitions. Second operand 21 states. [2020-10-15 20:08:58,155 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-10-15 20:08:59,871 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-15 20:09:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:00,469 INFO L93 Difference]: Finished difference Result 773 states and 1648 transitions. [2020-10-15 20:09:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-15 20:09:00,471 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:09:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:00,476 INFO L225 Difference]: With dead ends: 773 [2020-10-15 20:09:00,476 INFO L226 Difference]: Without dead ends: 733 [2020-10-15 20:09:00,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=202, Invalid=1358, Unknown=0, NotChecked=0, Total=1560 [2020-10-15 20:09:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2020-10-15 20:09:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 591. [2020-10-15 20:09:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-15 20:09:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1274 transitions. [2020-10-15 20:09:00,488 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1274 transitions. Word has length 38 [2020-10-15 20:09:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:00,489 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 1274 transitions. [2020-10-15 20:09:00,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:09:00,489 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1274 transitions. [2020-10-15 20:09:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:09:00,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:00,490 INFO L422 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] [2020-10-15 20:09:00,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 20:09:00,491 INFO L429 AbstractCegarLoop]: === Iteration 23 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:09:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:00,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1334893073, now seen corresponding path program 7 times [2020-10-15 20:09:00,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:00,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945532893] [2020-10-15 20:09:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:00,828 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-10-15 20:09:01,567 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-15 20:09:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:02,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945532893] [2020-10-15 20:09:02,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:02,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:09:02,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694732525] [2020-10-15 20:09:02,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:09:02,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:09:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:09:02,290 INFO L87 Difference]: Start difference. First operand 591 states and 1274 transitions. Second operand 21 states. [2020-10-15 20:09:04,181 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-10-15 20:09:05,946 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-15 20:09:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:06,513 INFO L93 Difference]: Finished difference Result 777 states and 1654 transitions. [2020-10-15 20:09:06,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-15 20:09:06,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:09:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:06,518 INFO L225 Difference]: With dead ends: 777 [2020-10-15 20:09:06,519 INFO L226 Difference]: Without dead ends: 737 [2020-10-15 20:09:06,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=206, Invalid=1354, Unknown=0, NotChecked=0, Total=1560 [2020-10-15 20:09:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2020-10-15 20:09:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 593. [2020-10-15 20:09:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2020-10-15 20:09:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1277 transitions. [2020-10-15 20:09:06,530 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1277 transitions. Word has length 38 [2020-10-15 20:09:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:06,531 INFO L481 AbstractCegarLoop]: Abstraction has 593 states and 1277 transitions. [2020-10-15 20:09:06,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:09:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1277 transitions. [2020-10-15 20:09:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:09:06,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:06,532 INFO L422 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] [2020-10-15 20:09:06,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 20:09:06,533 INFO L429 AbstractCegarLoop]: === Iteration 24 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:09:06,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:06,533 INFO L82 PathProgramCache]: Analyzing trace with hash -95861579, now seen corresponding path program 8 times [2020-10-15 20:09:06,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:06,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904061356] [2020-10-15 20:09:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:06,819 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2020-10-15 20:09:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:07,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904061356] [2020-10-15 20:09:07,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:07,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-15 20:09:07,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236052231] [2020-10-15 20:09:07,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-15 20:09:07,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:07,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-15 20:09:07,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2020-10-15 20:09:07,856 INFO L87 Difference]: Start difference. First operand 593 states and 1277 transitions. Second operand 20 states. [2020-10-15 20:09:09,514 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-10-15 20:09:09,943 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-10-15 20:09:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:11,922 INFO L93 Difference]: Finished difference Result 1107 states and 2388 transitions. [2020-10-15 20:09:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-15 20:09:11,923 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2020-10-15 20:09:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:11,928 INFO L225 Difference]: With dead ends: 1107 [2020-10-15 20:09:11,928 INFO L226 Difference]: Without dead ends: 1067 [2020-10-15 20:09:11,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=264, Invalid=1716, Unknown=0, NotChecked=0, Total=1980 [2020-10-15 20:09:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2020-10-15 20:09:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 602. [2020-10-15 20:09:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2020-10-15 20:09:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1300 transitions. [2020-10-15 20:09:11,940 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1300 transitions. Word has length 38 [2020-10-15 20:09:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:11,941 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 1300 transitions. [2020-10-15 20:09:11,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-15 20:09:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1300 transitions. [2020-10-15 20:09:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:09:11,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:11,943 INFO L422 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] [2020-10-15 20:09:11,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-15 20:09:11,943 INFO L429 AbstractCegarLoop]: === Iteration 25 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:09:11,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:11,943 INFO L82 PathProgramCache]: Analyzing trace with hash -930265675, now seen corresponding path program 9 times [2020-10-15 20:09:11,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:11,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014682308] [2020-10-15 20:09:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:12,345 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2020-10-15 20:09:12,481 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2020-10-15 20:09:13,213 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2020-10-15 20:09:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:13,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014682308] [2020-10-15 20:09:13,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:13,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-15 20:09:13,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822315194] [2020-10-15 20:09:13,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-15 20:09:13,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:13,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-15 20:09:13,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2020-10-15 20:09:13,854 INFO L87 Difference]: Start difference. First operand 602 states and 1300 transitions. Second operand 20 states. [2020-10-15 20:09:15,480 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-10-15 20:09:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:16,852 INFO L93 Difference]: Finished difference Result 901 states and 1917 transitions. [2020-10-15 20:09:16,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-15 20:09:16,853 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2020-10-15 20:09:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:16,855 INFO L225 Difference]: With dead ends: 901 [2020-10-15 20:09:16,855 INFO L226 Difference]: Without dead ends: 861 [2020-10-15 20:09:16,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2020-10-15 20:09:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-10-15 20:09:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 599. [2020-10-15 20:09:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2020-10-15 20:09:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1293 transitions. [2020-10-15 20:09:16,867 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1293 transitions. Word has length 38 [2020-10-15 20:09:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:16,867 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 1293 transitions. [2020-10-15 20:09:16,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-15 20:09:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1293 transitions. [2020-10-15 20:09:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:09:16,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:16,869 INFO L422 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] [2020-10-15 20:09:16,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-15 20:09:16,869 INFO L429 AbstractCegarLoop]: === Iteration 26 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:09:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash 390432681, now seen corresponding path program 10 times [2020-10-15 20:09:16,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:16,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732532885] [2020-10-15 20:09:16,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:17,192 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2020-10-15 20:09:17,539 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2020-10-15 20:09:17,777 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2020-10-15 20:09:18,023 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2020-10-15 20:09:18,770 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2020-10-15 20:09:18,931 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-10-15 20:09:19,268 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-10-15 20:09:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:19,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732532885] [2020-10-15 20:09:19,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:19,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:09:19,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834280836] [2020-10-15 20:09:19,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:09:19,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:19,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:09:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:09:19,904 INFO L87 Difference]: Start difference. First operand 599 states and 1293 transitions. Second operand 21 states. [2020-10-15 20:09:20,537 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2020-10-15 20:09:21,411 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 50 [2020-10-15 20:09:21,871 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2020-10-15 20:09:22,880 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-10-15 20:09:23,022 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2020-10-15 20:09:23,279 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2020-10-15 20:09:23,688 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-10-15 20:09:24,015 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2020-10-15 20:09:26,162 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2020-10-15 20:09:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:26,618 INFO L93 Difference]: Finished difference Result 997 states and 2127 transitions. [2020-10-15 20:09:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-15 20:09:26,619 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:09:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:26,622 INFO L225 Difference]: With dead ends: 997 [2020-10-15 20:09:26,622 INFO L226 Difference]: Without dead ends: 957 [2020-10-15 20:09:26,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=239, Invalid=1483, Unknown=0, NotChecked=0, Total=1722 [2020-10-15 20:09:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2020-10-15 20:09:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 598. [2020-10-15 20:09:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2020-10-15 20:09:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1289 transitions. [2020-10-15 20:09:26,634 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1289 transitions. Word has length 38 [2020-10-15 20:09:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:26,634 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 1289 transitions. [2020-10-15 20:09:26,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:09:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1289 transitions. [2020-10-15 20:09:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:09:26,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:26,636 INFO L422 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] [2020-10-15 20:09:26,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-15 20:09:26,636 INFO L429 AbstractCegarLoop]: === Iteration 27 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:09:26,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:26,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1465375079, now seen corresponding path program 11 times [2020-10-15 20:09:26,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:26,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177033475] [2020-10-15 20:09:26,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:26,949 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-10-15 20:09:27,508 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2020-10-15 20:09:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:28,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177033475] [2020-10-15 20:09:28,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:28,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:09:28,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365517461] [2020-10-15 20:09:28,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:09:28,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:28,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:09:28,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:09:28,314 INFO L87 Difference]: Start difference. First operand 598 states and 1289 transitions. Second operand 21 states. [2020-10-15 20:09:30,311 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2020-10-15 20:09:30,882 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2020-10-15 20:09:31,097 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-10-15 20:09:31,945 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2020-10-15 20:09:32,220 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2020-10-15 20:09:32,500 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2020-10-15 20:09:32,956 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-10-15 20:09:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:33,293 INFO L93 Difference]: Finished difference Result 1020 states and 2202 transitions. [2020-10-15 20:09:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-15 20:09:33,295 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:09:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:33,298 INFO L225 Difference]: With dead ends: 1020 [2020-10-15 20:09:33,298 INFO L226 Difference]: Without dead ends: 980 [2020-10-15 20:09:33,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=328, Invalid=1928, Unknown=0, NotChecked=0, Total=2256 [2020-10-15 20:09:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2020-10-15 20:09:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 605. [2020-10-15 20:09:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2020-10-15 20:09:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1304 transitions. [2020-10-15 20:09:33,311 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1304 transitions. Word has length 38 [2020-10-15 20:09:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:33,312 INFO L481 AbstractCegarLoop]: Abstraction has 605 states and 1304 transitions. [2020-10-15 20:09:33,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:09:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1304 transitions. [2020-10-15 20:09:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-15 20:09:33,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:33,314 INFO L422 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] [2020-10-15 20:09:33,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-15 20:09:33,314 INFO L429 AbstractCegarLoop]: === Iteration 28 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:09:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash -875028295, now seen corresponding path program 12 times [2020-10-15 20:09:33,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:33,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869752900] [2020-10-15 20:09:33,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:33,647 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-10-15 20:09:34,275 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-15 20:09:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:34,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869752900] [2020-10-15 20:09:34,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:34,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-15 20:09:34,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956548803] [2020-10-15 20:09:34,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-15 20:09:34,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-15 20:09:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2020-10-15 20:09:34,974 INFO L87 Difference]: Start difference. First operand 605 states and 1304 transitions. Second operand 21 states. [2020-10-15 20:09:36,867 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-10-15 20:09:38,660 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-10-15 20:09:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:39,206 INFO L93 Difference]: Finished difference Result 795 states and 1692 transitions. [2020-10-15 20:09:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-15 20:09:39,208 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-10-15 20:09:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:39,210 INFO L225 Difference]: With dead ends: 795 [2020-10-15 20:09:39,210 INFO L226 Difference]: Without dead ends: 755 [2020-10-15 20:09:39,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2020-10-15 20:09:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2020-10-15 20:09:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 607. [2020-10-15 20:09:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2020-10-15 20:09:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1309 transitions. [2020-10-15 20:09:39,219 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1309 transitions. Word has length 38 [2020-10-15 20:09:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:39,219 INFO L481 AbstractCegarLoop]: Abstraction has 607 states and 1309 transitions. [2020-10-15 20:09:39,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-15 20:09:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1309 transitions. [2020-10-15 20:09:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-15 20:09:39,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:39,221 INFO L422 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] [2020-10-15 20:09:39,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-15 20:09:39,221 INFO L429 AbstractCegarLoop]: === Iteration 29 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:09:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:39,222 INFO L82 PathProgramCache]: Analyzing trace with hash 317556797, now seen corresponding path program 1 times [2020-10-15 20:09:39,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:39,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549794573] [2020-10-15 20:09:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:39,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549794573] [2020-10-15 20:09:39,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:39,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 20:09:39,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030464752] [2020-10-15 20:09:39,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 20:09:39,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:39,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 20:09:39,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 20:09:39,255 INFO L87 Difference]: Start difference. First operand 607 states and 1309 transitions. Second operand 3 states. [2020-10-15 20:09:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:39,270 INFO L93 Difference]: Finished difference Result 669 states and 1434 transitions. [2020-10-15 20:09:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 20:09:39,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-10-15 20:09:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:39,273 INFO L225 Difference]: With dead ends: 669 [2020-10-15 20:09:39,273 INFO L226 Difference]: Without dead ends: 619 [2020-10-15 20:09:39,274 INFO L677 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 [2020-10-15 20:09:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-10-15 20:09:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 577. [2020-10-15 20:09:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2020-10-15 20:09:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1235 transitions. [2020-10-15 20:09:39,283 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1235 transitions. Word has length 40 [2020-10-15 20:09:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:39,283 INFO L481 AbstractCegarLoop]: Abstraction has 577 states and 1235 transitions. [2020-10-15 20:09:39,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 20:09:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1235 transitions. [2020-10-15 20:09:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-15 20:09:39,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:39,284 INFO L422 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] [2020-10-15 20:09:39,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-15 20:09:39,284 INFO L429 AbstractCegarLoop]: === Iteration 30 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 20:09:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash 325311869, now seen corresponding path program 2 times [2020-10-15 20:09:39,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:39,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956200725] [2020-10-15 20:09:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 20:09:39,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 20:09:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 20:09:39,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 20:09:39,420 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 20:09:39,420 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 20:09:39,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-15 20:09:39,421 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 20:09:39,422 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 20:09:39,428 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] ULTIMATE.startENTRY-->L1039-2: Formula: (let ((.cse9 (store |#valid_In-188483256| 0 0))) (let ((.cse4 (store .cse9 |#t~string33.base_Out-188483256| 1))) (let ((.cse2 (store .cse4 |#t~string36.base_Out-188483256| 1))) (let ((.cse1 (store .cse2 |~#m~0.base_Out-188483256| 1))) (let ((.cse0 (store .cse1 |~#stored_elements~0.base_Out-188483256| 1))) (let ((.cse8 (store .cse0 |~#queue~0.base_Out-188483256| 1))) (let ((.cse7 (store .cse8 |ULTIMATE.start_main_~#id1~0.base_Out-188483256| 1)) (.cse3 (select |#memory_int_In-188483256| |~#m~0.base_Out-188483256|))) (and (= (select .cse0 |~#queue~0.base_Out-188483256|) 0) (= (select .cse1 |~#stored_elements~0.base_Out-188483256|) 0) (= |ULTIMATE.start_init_#in~q.base_Out-188483256| |~#queue~0.base_Out-188483256|) (< |#StackHeapBarrier_In-188483256| |#t~string33.base_Out-188483256|) (< |#StackHeapBarrier_In-188483256| |ULTIMATE.start_main_~#id2~0.base_Out-188483256|) (< |#StackHeapBarrier_In-188483256| |~#queue~0.base_Out-188483256|) (= |#t~string36.offset_Out-188483256| 0) (= (select .cse2 |~#m~0.base_Out-188483256|) 0) (= (select .cse3 |~#m~0.offset_Out-188483256|) 0) (= 0 |#NULL.offset_Out-188483256|) (< |#StackHeapBarrier_In-188483256| |#t~string36.base_Out-188483256|) (= (select .cse4 |#t~string36.base_Out-188483256|) 0) (= |#memory_int_Out-188483256| (let ((.cse5 (let ((.cse6 ((as const (Array Int Int)) 0))) (store (store |#memory_int_In-188483256| |~#stored_elements~0.base_Out-188483256| .cse6) |~#queue~0.base_Out-188483256| .cse6)))) (store .cse5 ULTIMATE.start_init_~q.base_Out-188483256 (store (store (store (select .cse5 ULTIMATE.start_init_~q.base_Out-188483256) (+ ULTIMATE.start_init_~q.offset_Out-188483256 80) 0) (+ ULTIMATE.start_init_~q.offset_Out-188483256 84) 0) (+ ULTIMATE.start_init_~q.offset_Out-188483256 88) 0)))) (= |ULTIMATE.start_empty_#in~q.offset_Out-188483256| ULTIMATE.start_empty_~q.offset_Out-188483256) (= |~#queue~0.offset_Out-188483256| |ULTIMATE.start_init_#in~q.offset_Out-188483256|) (< 0 |#StackHeapBarrier_In-188483256|) (= |~#stored_elements~0.offset_Out-188483256| 0) (= |ULTIMATE.start_main_~#id2~0.offset_Out-188483256| 0) (= (store .cse7 |ULTIMATE.start_main_~#id2~0.base_Out-188483256| 1) |#valid_Out-188483256|) (= |#length_Out-188483256| (store (store (store (store (store (store (store |#length_In-188483256| |#t~string33.base_Out-188483256| 16) |#t~string36.base_Out-188483256| 15) |~#m~0.base_Out-188483256| 24) |~#stored_elements~0.base_Out-188483256| 80) |~#queue~0.base_Out-188483256| 92) |ULTIMATE.start_main_~#id1~0.base_Out-188483256| 4) |ULTIMATE.start_main_~#id2~0.base_Out-188483256| 4)) (= |#NULL.base_Out-188483256| 0) (= |~#queue~0.base_Out-188483256| |ULTIMATE.start_empty_#in~q.base_Out-188483256|) (= (select .cse8 |ULTIMATE.start_main_~#id1~0.base_Out-188483256|) 0) (= (- 1) |ULTIMATE.start_empty_#res_Out-188483256|) (< |#StackHeapBarrier_In-188483256| |~#m~0.base_Out-188483256|) (= ULTIMATE.start_init_~q.offset_Out-188483256 |ULTIMATE.start_init_#in~q.offset_Out-188483256|) (= (select .cse3 (+ |~#m~0.offset_Out-188483256| 4)) 0) (= (select .cse7 |ULTIMATE.start_main_~#id2~0.base_Out-188483256|) 0) (= (select .cse3 (+ |~#m~0.offset_Out-188483256| 8)) 0) (= 0 |#t~string33.offset_Out-188483256|) (= |ULTIMATE.start_init_#in~q.base_Out-188483256| ULTIMATE.start_init_~q.base_Out-188483256) (= |~#m~0.offset_Out-188483256| 0) (= |ULTIMATE.start_empty_#res_Out-188483256| |ULTIMATE.start_main_#t~ret62_Out-188483256|) (= ~enqueue_flag~0_Out-188483256 1) (= (select .cse3 (+ |~#m~0.offset_Out-188483256| 16)) 0) (= (select .cse9 |#t~string33.base_Out-188483256|) 0) (= |ULTIMATE.start_empty_#in~q.offset_Out-188483256| |~#queue~0.offset_Out-188483256|) (< |#StackHeapBarrier_In-188483256| |ULTIMATE.start_main_~#id1~0.base_Out-188483256|) (= ~dequeue_flag~0_Out-188483256 0) (= (select .cse3 (+ |~#m~0.offset_Out-188483256| 12)) 0) (= |~#queue~0.offset_Out-188483256| 0) (= |ULTIMATE.start_main_~#id1~0.offset_Out-188483256| 0) (= ULTIMATE.start_empty_~q.base_Out-188483256 |ULTIMATE.start_empty_#in~q.base_Out-188483256|) (< |#StackHeapBarrier_In-188483256| |~#stored_elements~0.base_Out-188483256|))))))))) InVars {#StackHeapBarrier=|#StackHeapBarrier_In-188483256|, #valid=|#valid_In-188483256|, #memory_int=|#memory_int_In-188483256|, #length=|#length_In-188483256|} OutVars{ULTIMATE.start_main_#t~mem66=|ULTIMATE.start_main_#t~mem66_Out-188483256|, ULTIMATE.start_main_#t~mem65=|ULTIMATE.start_main_#t~mem65_Out-188483256|, #t~string33.offset=|#t~string33.offset_Out-188483256|, ULTIMATE.start_empty_~q.offset=ULTIMATE.start_empty_~q.offset_Out-188483256, ULTIMATE.start_main_~#id1~0.base=|ULTIMATE.start_main_~#id1~0.base_Out-188483256|, #NULL.offset=|#NULL.offset_Out-188483256|, ULTIMATE.start_empty_#t~mem30=|ULTIMATE.start_empty_#t~mem30_Out-188483256|, ULTIMATE.start_empty_#t~mem31=|ULTIMATE.start_empty_#t~mem31_Out-188483256|, ULTIMATE.start_empty_~q.base=ULTIMATE.start_empty_~q.base_Out-188483256, #t~string36.offset=|#t~string36.offset_Out-188483256|, #t~string36.base=|#t~string36.base_Out-188483256|, ULTIMATE.start_main_~#id2~0.base=|ULTIMATE.start_main_~#id2~0.base_Out-188483256|, ULTIMATE.start_main_~#id2~0.offset=|ULTIMATE.start_main_~#id2~0.offset_Out-188483256|, ~#queue~0.base=|~#queue~0.base_Out-188483256|, ULTIMATE.start_init_~q.base=ULTIMATE.start_init_~q.base_Out-188483256, ULTIMATE.start_empty_#t~nondet32=|ULTIMATE.start_empty_#t~nondet32_Out-188483256|, ~#queue~0.offset=|~#queue~0.offset_Out-188483256|, #length=|#length_Out-188483256|, ULTIMATE.start_empty_#res=|ULTIMATE.start_empty_#res_Out-188483256|, ~#stored_elements~0.offset=|~#stored_elements~0.offset_Out-188483256|, #t~string33.base=|#t~string33.base_Out-188483256|, ULTIMATE.start_main_#t~nondet64=|ULTIMATE.start_main_#t~nondet64_Out-188483256|, ULTIMATE.start_main_#t~nondet63=|ULTIMATE.start_main_#t~nondet63_Out-188483256|, ULTIMATE.start_main_#t~ret62=|ULTIMATE.start_main_#t~ret62_Out-188483256|, ~dequeue_flag~0=~dequeue_flag~0_Out-188483256, ULTIMATE.start_empty_#in~q.base=|ULTIMATE.start_empty_#in~q.base_Out-188483256|, ULTIMATE.start_empty_#in~q.offset=|ULTIMATE.start_empty_#in~q.offset_Out-188483256|, #NULL.base=|#NULL.base_Out-188483256|, ULTIMATE.start_init_#in~q.base=|ULTIMATE.start_init_#in~q.base_Out-188483256|, ~#m~0.base=|~#m~0.base_Out-188483256|, #StackHeapBarrier=|#StackHeapBarrier_In-188483256|, ~#stored_elements~0.base=|~#stored_elements~0.base_Out-188483256|, ~enqueue_flag~0=~enqueue_flag~0_Out-188483256, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out-188483256|, ~#m~0.offset=|~#m~0.offset_Out-188483256|, #valid=|#valid_Out-188483256|, #memory_int=|#memory_int_Out-188483256|, ULTIMATE.start_init_#in~q.offset=|ULTIMATE.start_init_#in~q.offset_Out-188483256|, ULTIMATE.start_init_~q.offset=ULTIMATE.start_init_~q.offset_Out-188483256, ULTIMATE.start_main_~#id1~0.offset=|ULTIMATE.start_main_~#id1~0.offset_Out-188483256|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem66, ULTIMATE.start_main_#t~mem65, #t~string33.offset, ULTIMATE.start_empty_~q.offset, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, ULTIMATE.start_empty_#t~mem30, ULTIMATE.start_empty_#t~mem31, ULTIMATE.start_empty_~q.base, #t~string36.offset, #t~string36.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ~#queue~0.base, ULTIMATE.start_init_~q.base, ULTIMATE.start_empty_#t~nondet32, ~#queue~0.offset, #length, ULTIMATE.start_empty_#res, ~#stored_elements~0.offset, #t~string33.base, ULTIMATE.start_main_#t~nondet64, ULTIMATE.start_main_#t~nondet63, ULTIMATE.start_main_#t~ret62, ~dequeue_flag~0, ULTIMATE.start_empty_#in~q.base, ULTIMATE.start_empty_#in~q.offset, #NULL.base, ULTIMATE.start_init_#in~q.base, ~#m~0.base, ~#stored_elements~0.base, ~enqueue_flag~0, ULTIMATE.start_main_#res, ~#m~0.offset, #valid, #memory_int, ULTIMATE.start_init_#in~q.offset, ULTIMATE.start_init_~q.offset, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2020-10-15 20:09:39,438 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] L941-1-->L995-2: Formula: (let ((.cse0 (= |t1Thread1of1ForFork0_empty_#res_Out1048240738| |t1Thread1of1ForFork0_#t~ret53_Out1048240738|)) (.cse1 (= |t1Thread1of1ForFork0_empty_#t~mem30_In1048240738| (select (select |#memory_int_In1048240738| t1Thread1of1ForFork0_empty_~q.base_In1048240738) (+ t1Thread1of1ForFork0_empty_~q.offset_In1048240738 84))))) (or (and .cse0 (= (- 1) |t1Thread1of1ForFork0_empty_#res_Out1048240738|) .cse1) (and (= |t1Thread1of1ForFork0_empty_#res_Out1048240738| 0) .cse0 (= |t1Thread1of1ForFork0_empty_#t~nondet32_In1048240738| |t1Thread1of1ForFork0_empty_#t~nondet32_Out1048240738|) (not .cse1)))) InVars {t1Thread1of1ForFork0_empty_~q.base=t1Thread1of1ForFork0_empty_~q.base_In1048240738, t1Thread1of1ForFork0_empty_#t~nondet32=|t1Thread1of1ForFork0_empty_#t~nondet32_In1048240738|, t1Thread1of1ForFork0_empty_#t~mem30=|t1Thread1of1ForFork0_empty_#t~mem30_In1048240738|, #memory_int=|#memory_int_In1048240738|, t1Thread1of1ForFork0_empty_~q.offset=t1Thread1of1ForFork0_empty_~q.offset_In1048240738} OutVars{t1Thread1of1ForFork0_empty_~q.base=t1Thread1of1ForFork0_empty_~q.base_In1048240738, t1Thread1of1ForFork0_#t~ret53=|t1Thread1of1ForFork0_#t~ret53_Out1048240738|, t1Thread1of1ForFork0_empty_#t~nondet32=|t1Thread1of1ForFork0_empty_#t~nondet32_Out1048240738|, t1Thread1of1ForFork0_empty_#res=|t1Thread1of1ForFork0_empty_#res_Out1048240738|, t1Thread1of1ForFork0_empty_#t~mem31=|t1Thread1of1ForFork0_empty_#t~mem31_Out1048240738|, t1Thread1of1ForFork0_empty_#t~mem30=|t1Thread1of1ForFork0_empty_#t~mem30_Out1048240738|, #memory_int=|#memory_int_In1048240738|, t1Thread1of1ForFork0_empty_~q.offset=t1Thread1of1ForFork0_empty_~q.offset_In1048240738} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~ret53, t1Thread1of1ForFork0_empty_#t~nondet32, t1Thread1of1ForFork0_empty_#res, t1Thread1of1ForFork0_empty_#t~mem31, t1Thread1of1ForFork0_empty_#t~mem30] because there is no mapped edge [2020-10-15 20:09:39,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 08:09:39 BasicIcfg [2020-10-15 20:09:39,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 20:09:39,582 INFO L168 Benchmark]: Toolchain (without parser) took 130950.08 ms. Allocated memory was 249.6 MB in the beginning and 690.5 MB in the end (delta: 440.9 MB). Free memory was 203.9 MB in the beginning and 430.2 MB in the end (delta: -226.3 MB). Peak memory consumption was 214.7 MB. Max. memory is 14.2 GB. [2020-10-15 20:09:39,582 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 14.2 GB. [2020-10-15 20:09:39,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 954.60 ms. Allocated memory was 249.6 MB in the beginning and 310.4 MB in the end (delta: 60.8 MB). Free memory was 203.9 MB in the beginning and 238.3 MB in the end (delta: -34.4 MB). Peak memory consumption was 36.5 MB. Max. memory is 14.2 GB. [2020-10-15 20:09:39,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.93 ms. Allocated memory is still 310.4 MB. Free memory was 238.3 MB in the beginning and 235.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-15 20:09:39,583 INFO L168 Benchmark]: Boogie Preprocessor took 50.26 ms. Allocated memory is still 310.4 MB. Free memory was 235.0 MB in the beginning and 232.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 20:09:39,584 INFO L168 Benchmark]: RCFGBuilder took 729.37 ms. Allocated memory is still 310.4 MB. Free memory was 232.4 MB in the beginning and 185.4 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 14.2 GB. [2020-10-15 20:09:39,584 INFO L168 Benchmark]: TraceAbstraction took 129133.33 ms. Allocated memory was 310.4 MB in the beginning and 690.5 MB in the end (delta: 380.1 MB). Free memory was 184.5 MB in the beginning and 430.2 MB in the end (delta: -245.6 MB). Peak memory consumption was 134.5 MB. Max. memory is 14.2 GB. [2020-10-15 20:09:39,586 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 954.60 ms. Allocated memory was 249.6 MB in the beginning and 310.4 MB in the end (delta: 60.8 MB). Free memory was 203.9 MB in the beginning and 238.3 MB in the end (delta: -34.4 MB). Peak memory consumption was 36.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 75.93 ms. Allocated memory is still 310.4 MB. Free memory was 238.3 MB in the beginning and 235.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 50.26 ms. Allocated memory is still 310.4 MB. Free memory was 235.0 MB in the beginning and 232.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 729.37 ms. Allocated memory is still 310.4 MB. Free memory was 232.4 MB in the beginning and 185.4 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 129133.33 ms. Allocated memory was 310.4 MB in the beginning and 690.5 MB in the end (delta: 380.1 MB). Free memory was 184.5 MB in the beginning and 430.2 MB in the end (delta: -245.6 MB). Peak memory consumption was 134.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 10047 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 181 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 725 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.5s, 234 PlacesBefore, 66 PlacesAfterwards, 244 TransitionsBefore, 72 TransitionsAfterwards, 14896 CoEnabledTransitionPairs, 9 FixpointIterations, 63 TrivialSequentialCompositions, 115 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 24 ConcurrentYvCompositions, 4 ChoiceCompositions, 207 TotalNumberOfCompositions, 39936 MoverChecksTotal - CounterExampleResult [Line: 1024]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1039] COND FALSE 0 !(!empty(&queue)==(-1)) [L1044] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L988] 1 int value, i; [L990] 1 value = __VERIFIER_nondet_int() [L961] EXPR 1 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L961] 1 q->element[q->tail] = x [L1045] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L1017] 2 int i; [L1018] 2 i=0 VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L962] EXPR 1 q->amount [L962] 1 q->amount++ [L963] EXPR 1 q->tail [L963] COND FALSE 1 !(q->tail == (20)) [L969] EXPR 1 q->tail [L969] 1 q->tail++ [L971] 1 return 0; [L991] COND FALSE 1 !(enqueue(&queue,value)) [L994] 1 stored_elements[0]=value [L941] 1 q->head VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L995] COND FALSE 1 !(empty(&queue)) [L999] 1 i=0 VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L1018] COND TRUE 2 i<(20) [L1021] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L1018] 2 i++ VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L999] COND TRUE 1 i<((20)-1) [L1002] COND TRUE 1 \read(enqueue_flag) [L1004] 1 value = __VERIFIER_nondet_int() [L961] EXPR 1 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L961] 1 q->element[q->tail] = x [L962] EXPR 1 q->amount [L962] 1 q->amount++ [L963] EXPR 1 q->tail [L963] COND FALSE 1 !(q->tail == (20)) VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L969] EXPR 1 q->tail [L969] 1 q->tail++ [L971] 1 return 0; [L1006] 1 stored_elements[i+1]=value VAL [dequeue_flag=0, enqueue_flag=1, m={7:0}, queue={3:0}, stored_elements={9:0}] [L1007] 1 enqueue_flag=(0) VAL [dequeue_flag=0, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={9:0}] [L1008] 1 dequeue_flag=(1) VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={9:0}] [L1018] COND TRUE 2 i<(20) [L1021] COND TRUE 2 \read(dequeue_flag) [L975] 2 int x; [L976] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={9:0}] [L976] EXPR 2 q->element[q->head] [L976] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={9:0}] [L977] EXPR 2 q->amount [L977] 2 q->amount-- [L978] EXPR 2 q->head [L978] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={9:0}] [L983] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={9:0}] [L983] 2 q->head++ [L984] 2 return x; [L1023] EXPR 2 stored_elements[i] [L1023] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1024] 2 __VERIFIER_error() VAL [dequeue_flag=1, enqueue_flag=0, m={7:0}, queue={3:0}, stored_elements={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 228 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 128.7s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 80.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 1736 SDtfs, 3050 SDslu, 8174 SDs, 0 SdLazy, 22856 SolverSat, 715 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 705 GetRequests, 48 SyntacticMatches, 35 SemanticMatches, 622 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4099 ImplicationChecksByTransitivity, 63.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1165occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 3435 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 35.6s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 1001924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...