/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 17:53:07,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 17:53:07,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 17:53:07,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 17:53:07,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 17:53:07,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 17:53:07,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 17:53:07,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 17:53:07,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 17:53:07,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 17:53:07,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 17:53:07,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 17:53:07,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 17:53:07,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 17:53:07,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 17:53:07,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 17:53:07,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 17:53:07,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 17:53:07,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 17:53:07,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 17:53:07,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 17:53:07,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 17:53:07,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 17:53:07,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 17:53:07,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 17:53:07,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 17:53:07,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 17:53:07,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 17:53:07,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 17:53:07,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 17:53:07,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 17:53:07,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 17:53:07,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 17:53:07,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 17:53:07,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 17:53:07,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 17:53:07,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 17:53:07,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 17:53:07,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 17:53:07,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 17:53:07,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 17:53:07,384 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-NoLbe.epf [2021-06-05 17:53:07,418 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 17:53:07,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 17:53:07,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 17:53:07,419 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 17:53:07,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 17:53:07,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 17:53:07,421 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 17:53:07,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 17:53:07,422 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 17:53:07,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 17:53:07,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 17:53:07,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 17:53:07,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 17:53:07,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 17:53:07,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 17:53:07,423 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 17:53:07,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 17:53:07,424 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 17:53:07,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 17:53:07,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 17:53:07,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 17:53:07,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 17:53:07,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 17:53:07,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 17:53:07,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 17:53:07,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 17:53:07,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 17:53:07,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 17:53:07,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 17:53:07,425 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 17:53:07,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 17:53:07,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 17:53:07,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 17:53:07,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 17:53:07,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 17:53:07,747 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 17:53:07,747 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 17:53:07,748 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2021-06-05 17:53:07,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0e17f02/935fcd4bd01a40449140af729530c420/FLAG66bb53fd2 [2021-06-05 17:53:08,348 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 17:53:08,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2021-06-05 17:53:08,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0e17f02/935fcd4bd01a40449140af729530c420/FLAG66bb53fd2 [2021-06-05 17:53:08,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa0e17f02/935fcd4bd01a40449140af729530c420 [2021-06-05 17:53:08,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 17:53:08,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 17:53:08,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 17:53:08,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 17:53:08,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 17:53:08,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 05:53:08" (1/1) ... [2021-06-05 17:53:08,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304bb4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:08, skipping insertion in model container [2021-06-05 17:53:08,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 05:53:08" (1/1) ... [2021-06-05 17:53:08,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 17:53:08,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 17:53:09,262 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2021-06-05 17:53:09,271 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2021-06-05 17:53:09,277 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2021-06-05 17:53:09,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 17:53:09,294 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 17:53:09,351 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2021-06-05 17:53:09,353 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2021-06-05 17:53:09,355 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2021-06-05 17:53:09,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 17:53:09,463 INFO L208 MainTranslator]: Completed translation [2021-06-05 17:53:09,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09 WrapperNode [2021-06-05 17:53:09,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 17:53:09,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 17:53:09,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 17:53:09,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 17:53:09,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (1/1) ... [2021-06-05 17:53:09,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (1/1) ... [2021-06-05 17:53:09,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 17:53:09,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 17:53:09,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 17:53:09,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 17:53:09,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (1/1) ... [2021-06-05 17:53:09,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (1/1) ... [2021-06-05 17:53:09,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (1/1) ... [2021-06-05 17:53:09,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (1/1) ... [2021-06-05 17:53:09,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (1/1) ... [2021-06-05 17:53:09,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (1/1) ... [2021-06-05 17:53:09,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (1/1) ... [2021-06-05 17:53:09,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 17:53:09,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 17:53:09,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 17:53:09,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 17:53:09,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (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 [2021-06-05 17:53:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-05 17:53:09,623 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-05 17:53:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-05 17:53:09,623 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-05 17:53:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 17:53:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 17:53:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 17:53:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 17:53:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 17:53:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 17:53:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 17:53:09,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 17:53:09,626 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 17:53:10,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 17:53:10,317 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-06-05 17:53:10,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 05:53:10 BoogieIcfgContainer [2021-06-05 17:53:10,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 17:53:10,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 17:53:10,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 17:53:10,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 17:53:10,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 05:53:08" (1/3) ... [2021-06-05 17:53:10,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57281d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 05:53:10, skipping insertion in model container [2021-06-05 17:53:10,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 05:53:09" (2/3) ... [2021-06-05 17:53:10,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57281d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 05:53:10, skipping insertion in model container [2021-06-05 17:53:10,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 05:53:10" (3/3) ... [2021-06-05 17:53:10,328 INFO L111 eAbstractionObserver]: Analyzing ICFG queue.i [2021-06-05 17:53:10,333 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 17:53:10,333 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 17:53:10,333 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-05 17:53:10,333 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 17:53:10,379 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,379 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,379 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,379 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,380 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,380 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,380 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,381 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,381 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,382 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,382 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,382 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,383 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,383 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,383 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,384 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,385 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,385 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,385 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,385 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,386 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,386 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,387 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,387 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,387 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,387 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,387 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,387 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,388 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,388 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,388 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,388 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,388 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,388 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,389 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,389 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,389 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,389 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,389 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,389 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,389 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,389 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,389 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,390 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,390 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,390 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,390 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,390 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,390 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,390 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,390 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,390 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,391 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,391 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,391 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,391 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,391 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,391 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,391 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,391 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,391 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,392 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,392 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,392 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,392 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,392 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,392 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,392 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,392 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,393 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,393 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,393 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,394 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,395 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,395 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,395 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,395 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,395 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,395 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,395 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,395 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,396 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,397 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,397 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,397 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,397 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,397 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,397 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,397 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,398 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,399 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,399 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,400 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,400 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,400 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,400 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,400 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,400 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,400 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,401 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,401 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,401 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,401 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,401 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,401 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,401 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,402 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,403 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,404 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,405 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,405 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,405 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,405 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,405 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,405 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,406 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,407 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,407 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,407 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,407 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,407 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,407 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,407 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,408 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,408 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,408 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,408 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,408 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,408 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,408 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,409 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,409 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,409 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,409 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,409 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,410 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,410 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,410 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,410 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,410 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,410 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,410 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,411 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,411 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,411 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,412 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,412 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,412 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,412 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,413 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,413 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,414 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,414 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,414 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,415 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,415 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,415 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,416 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,416 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,416 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,416 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,416 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,417 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,417 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,417 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,417 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,417 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,417 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,417 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,418 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,418 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,418 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,418 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,418 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,418 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,418 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,418 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,419 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,419 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,419 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,419 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,419 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,419 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,419 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,419 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,420 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,420 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,420 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,420 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,420 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,420 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,420 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,421 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,421 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,421 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,422 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,422 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,422 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,423 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,423 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,423 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,423 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,423 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,423 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,424 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,425 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,425 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,425 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,425 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,425 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,425 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,426 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,426 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,426 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,426 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,427 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,428 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,428 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,428 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,428 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,428 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,428 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,428 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,429 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,430 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,430 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,430 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,430 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,430 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,431 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,431 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,431 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,431 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,432 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,432 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,432 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,432 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,432 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,432 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,432 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,433 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,433 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,433 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,433 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,433 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,433 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,433 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,434 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,434 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,434 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,434 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,434 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,434 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,434 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,435 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,435 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,435 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,435 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,435 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,435 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,435 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,436 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,436 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,436 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,436 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,436 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,436 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,436 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,437 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,437 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,437 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,437 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,437 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,437 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,437 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,437 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,437 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,438 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,438 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,438 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,438 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,438 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,438 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,438 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,438 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,438 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,439 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,439 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,439 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,439 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,439 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,439 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,440 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,440 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,440 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,440 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,440 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,440 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,441 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,441 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,441 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,441 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,441 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,441 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,441 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,442 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,442 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,442 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,442 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,442 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,443 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,443 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,443 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,443 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,443 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,443 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,443 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,443 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,444 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,444 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,444 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,444 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,444 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,444 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,444 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,444 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,445 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,445 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,445 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,445 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,445 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,445 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,445 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,445 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,446 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,446 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,446 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,446 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,446 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,446 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,446 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,446 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,447 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,447 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,447 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,447 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,447 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,447 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,447 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,448 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,448 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,448 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,448 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,448 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,448 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,448 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,449 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,464 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,465 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,465 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,465 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,465 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,465 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,465 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,465 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,466 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,467 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,467 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,467 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,467 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,467 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,467 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,467 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,467 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,467 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,468 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,469 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,469 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,469 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,469 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,469 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,469 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,469 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,469 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,469 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,470 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,472 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,472 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,472 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,472 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,472 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,472 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,473 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,474 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,475 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,475 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,475 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,475 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,475 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,475 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,475 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,475 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,475 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,479 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,479 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,479 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,480 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,480 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,480 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,480 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,481 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,481 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 17:53:10,494 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 17:53:10,513 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 17:53:10,530 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 17:53:10,530 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 17:53:10,530 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 17:53:10,532 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 17:53:10,532 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 17:53:10,533 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 17:53:10,533 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 17:53:10,533 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1Thread1of1ForFork0======== [2021-06-05 17:53:10,545 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 17:53:11,714 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 17:53:11,784 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:11,785 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:11,785 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash -432801653, now seen corresponding path program 1 times [2021-06-05 17:53:11,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:11,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910710189] [2021-06-05 17:53:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:12,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:12,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910710189] [2021-06-05 17:53:12,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910710189] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:12,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:12,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 17:53:12,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626609322] [2021-06-05 17:53:12,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 17:53:12,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:12,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 17:53:12,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 17:53:12,342 INFO L87 Difference]: Start difference. First operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:13,277 INFO L93 Difference]: Finished difference Result 23003 states and 64256 transitions. [2021-06-05 17:53:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 17:53:13,279 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 17:53:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:13,358 INFO L225 Difference]: With dead ends: 23003 [2021-06-05 17:53:13,358 INFO L226 Difference]: Without dead ends: 12639 [2021-06-05 17:53:13,360 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 355.6ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-05 17:53:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12639 states. [2021-06-05 17:53:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12639 to 12639. [2021-06-05 17:53:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12639 states, 12637 states have (on average 2.783176386800665) internal successors, (35171), 12638 states have internal predecessors, (35171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12639 states to 12639 states and 35171 transitions. [2021-06-05 17:53:13,889 INFO L78 Accepts]: Start accepts. Automaton has 12639 states and 35171 transitions. Word has length 83 [2021-06-05 17:53:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:13,890 INFO L482 AbstractCegarLoop]: Abstraction has 12639 states and 35171 transitions. [2021-06-05 17:53:13,890 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 12639 states and 35171 transitions. [2021-06-05 17:53:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 17:53:13,898 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:13,898 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:13,899 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 17:53:13,899 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:13,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:13,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1997559754, now seen corresponding path program 1 times [2021-06-05 17:53:13,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:13,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435139017] [2021-06-05 17:53:13,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:14,004 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:14,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435139017] [2021-06-05 17:53:14,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435139017] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:14,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:14,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 17:53:14,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909592090] [2021-06-05 17:53:14,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 17:53:14,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:14,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 17:53:14,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 17:53:14,008 INFO L87 Difference]: Start difference. First operand 12639 states and 35171 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:14,204 INFO L93 Difference]: Finished difference Result 12422 states and 34356 transitions. [2021-06-05 17:53:14,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 17:53:14,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 17:53:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:14,269 INFO L225 Difference]: With dead ends: 12422 [2021-06-05 17:53:14,270 INFO L226 Difference]: Without dead ends: 12422 [2021-06-05 17:53:14,270 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 17:53:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2021-06-05 17:53:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 12422. [2021-06-05 17:53:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12422 states, 12420 states have (on average 2.766183574879227) internal successors, (34356), 12421 states have internal predecessors, (34356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12422 states to 12422 states and 34356 transitions. [2021-06-05 17:53:14,724 INFO L78 Accepts]: Start accepts. Automaton has 12422 states and 34356 transitions. Word has length 84 [2021-06-05 17:53:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:14,726 INFO L482 AbstractCegarLoop]: Abstraction has 12422 states and 34356 transitions. [2021-06-05 17:53:14,726 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 12422 states and 34356 transitions. [2021-06-05 17:53:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 17:53:14,741 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:14,742 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:14,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 17:53:14,742 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash -724837919, now seen corresponding path program 1 times [2021-06-05 17:53:14,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:14,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621179995] [2021-06-05 17:53:14,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:14,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:14,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621179995] [2021-06-05 17:53:14,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621179995] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:14,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:14,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 17:53:14,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426235532] [2021-06-05 17:53:14,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 17:53:14,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:14,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 17:53:14,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 17:53:14,846 INFO L87 Difference]: Start difference. First operand 12422 states and 34356 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:14,936 INFO L93 Difference]: Finished difference Result 13073 states and 35933 transitions. [2021-06-05 17:53:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 17:53:14,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-06-05 17:53:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:14,968 INFO L225 Difference]: With dead ends: 13073 [2021-06-05 17:53:14,968 INFO L226 Difference]: Without dead ends: 11771 [2021-06-05 17:53:14,968 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 17:53:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2021-06-05 17:53:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11771. [2021-06-05 17:53:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11771 states, 11769 states have (on average 2.74832186252018) internal successors, (32345), 11770 states have internal predecessors, (32345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 32345 transitions. [2021-06-05 17:53:15,434 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 32345 transitions. Word has length 99 [2021-06-05 17:53:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:15,435 INFO L482 AbstractCegarLoop]: Abstraction has 11771 states and 32345 transitions. [2021-06-05 17:53:15,435 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 32345 transitions. [2021-06-05 17:53:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-05 17:53:15,452 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:15,452 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:15,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 17:53:15,453 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:15,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1651068086, now seen corresponding path program 1 times [2021-06-05 17:53:15,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:15,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827393585] [2021-06-05 17:53:15,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:15,937 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:15,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827393585] [2021-06-05 17:53:15,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827393585] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:15,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:15,937 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 17:53:15,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079671058] [2021-06-05 17:53:15,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 17:53:15,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:15,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 17:53:15,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 17:53:15,939 INFO L87 Difference]: Start difference. First operand 11771 states and 32345 transitions. Second operand has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:16,808 INFO L93 Difference]: Finished difference Result 12185 states and 33496 transitions. [2021-06-05 17:53:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 17:53:16,809 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-06-05 17:53:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:16,837 INFO L225 Difference]: With dead ends: 12185 [2021-06-05 17:53:16,837 INFO L226 Difference]: Without dead ends: 12185 [2021-06-05 17:53:16,837 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 627.4ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-06-05 17:53:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12185 states. [2021-06-05 17:53:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12185 to 11973. [2021-06-05 17:53:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11973 states, 11971 states have (on average 2.7489766936763846) internal successors, (32908), 11972 states have internal predecessors, (32908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11973 states to 11973 states and 32908 transitions. [2021-06-05 17:53:17,127 INFO L78 Accepts]: Start accepts. Automaton has 11973 states and 32908 transitions. Word has length 100 [2021-06-05 17:53:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:17,128 INFO L482 AbstractCegarLoop]: Abstraction has 11973 states and 32908 transitions. [2021-06-05 17:53:17,128 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 11973 states and 32908 transitions. [2021-06-05 17:53:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-06-05 17:53:17,144 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:17,144 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:17,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 17:53:17,145 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1578711888, now seen corresponding path program 1 times [2021-06-05 17:53:17,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:17,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860313629] [2021-06-05 17:53:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:17,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:17,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860313629] [2021-06-05 17:53:17,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860313629] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:17,974 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:17,974 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 17:53:17,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774129318] [2021-06-05 17:53:17,975 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 17:53:17,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 17:53:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2021-06-05 17:53:17,976 INFO L87 Difference]: Start difference. First operand 11973 states and 32908 transitions. Second operand has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:20,366 INFO L93 Difference]: Finished difference Result 12135 states and 33184 transitions. [2021-06-05 17:53:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 17:53:20,366 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-06-05 17:53:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:20,396 INFO L225 Difference]: With dead ends: 12135 [2021-06-05 17:53:20,396 INFO L226 Difference]: Without dead ends: 11918 [2021-06-05 17:53:20,397 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1961.1ms TimeCoverageRelationStatistics Valid=446, Invalid=2004, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 17:53:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11918 states. [2021-06-05 17:53:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11918 to 11918. [2021-06-05 17:53:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11918 states, 11916 states have (on average 2.75243370258476) internal successors, (32798), 11917 states have internal predecessors, (32798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11918 states to 11918 states and 32798 transitions. [2021-06-05 17:53:20,711 INFO L78 Accepts]: Start accepts. Automaton has 11918 states and 32798 transitions. Word has length 104 [2021-06-05 17:53:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:20,712 INFO L482 AbstractCegarLoop]: Abstraction has 11918 states and 32798 transitions. [2021-06-05 17:53:20,712 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 11918 states and 32798 transitions. [2021-06-05 17:53:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 17:53:20,732 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:20,732 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:20,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 17:53:20,733 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1198768392, now seen corresponding path program 1 times [2021-06-05 17:53:20,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:20,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179512322] [2021-06-05 17:53:20,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:21,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:21,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179512322] [2021-06-05 17:53:21,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179512322] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:21,232 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:21,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 17:53:21,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852657448] [2021-06-05 17:53:21,232 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 17:53:21,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:21,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 17:53:21,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 17:53:21,233 INFO L87 Difference]: Start difference. First operand 11918 states and 32798 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:22,511 INFO L93 Difference]: Finished difference Result 16890 states and 46551 transitions. [2021-06-05 17:53:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 17:53:22,511 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 17:53:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:22,556 INFO L225 Difference]: With dead ends: 16890 [2021-06-05 17:53:22,556 INFO L226 Difference]: Without dead ends: 16890 [2021-06-05 17:53:22,557 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 913.7ms TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 17:53:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16890 states. [2021-06-05 17:53:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16890 to 14265. [2021-06-05 17:53:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14265 states, 14263 states have (on average 2.7540489378111195) internal successors, (39281), 14264 states have internal predecessors, (39281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14265 states to 14265 states and 39281 transitions. [2021-06-05 17:53:22,948 INFO L78 Accepts]: Start accepts. Automaton has 14265 states and 39281 transitions. Word has length 105 [2021-06-05 17:53:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:22,948 INFO L482 AbstractCegarLoop]: Abstraction has 14265 states and 39281 transitions. [2021-06-05 17:53:22,949 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 14265 states and 39281 transitions. [2021-06-05 17:53:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 17:53:22,974 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:22,974 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:22,975 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 17:53:22,975 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:22,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:22,975 INFO L82 PathProgramCache]: Analyzing trace with hash 431874918, now seen corresponding path program 2 times [2021-06-05 17:53:22,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:22,976 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673605956] [2021-06-05 17:53:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:23,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:23,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673605956] [2021-06-05 17:53:23,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673605956] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:23,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:23,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 17:53:23,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077263077] [2021-06-05 17:53:23,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 17:53:23,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 17:53:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 17:53:23,329 INFO L87 Difference]: Start difference. First operand 14265 states and 39281 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:24,798 INFO L93 Difference]: Finished difference Result 19310 states and 53178 transitions. [2021-06-05 17:53:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 17:53:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 17:53:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:24,835 INFO L225 Difference]: With dead ends: 19310 [2021-06-05 17:53:24,836 INFO L226 Difference]: Without dead ends: 19310 [2021-06-05 17:53:24,839 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1004.0ms TimeCoverageRelationStatistics Valid=359, Invalid=1047, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 17:53:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19310 states. [2021-06-05 17:53:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19310 to 14271. [2021-06-05 17:53:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14271 states, 14269 states have (on average 2.7537318662835517) internal successors, (39293), 14270 states have internal predecessors, (39293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14271 states to 14271 states and 39293 transitions. [2021-06-05 17:53:25,244 INFO L78 Accepts]: Start accepts. Automaton has 14271 states and 39293 transitions. Word has length 105 [2021-06-05 17:53:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:25,245 INFO L482 AbstractCegarLoop]: Abstraction has 14271 states and 39293 transitions. [2021-06-05 17:53:25,245 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 14271 states and 39293 transitions. [2021-06-05 17:53:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 17:53:25,261 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:25,262 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:25,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 17:53:25,262 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:25,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1360916942, now seen corresponding path program 3 times [2021-06-05 17:53:25,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:25,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478048887] [2021-06-05 17:53:25,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:25,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:25,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478048887] [2021-06-05 17:53:25,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478048887] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:25,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:25,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 17:53:25,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540712382] [2021-06-05 17:53:25,639 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 17:53:25,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:25,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 17:53:25,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 17:53:25,639 INFO L87 Difference]: Start difference. First operand 14271 states and 39293 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:27,205 INFO L93 Difference]: Finished difference Result 18638 states and 51324 transitions. [2021-06-05 17:53:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 17:53:27,205 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 17:53:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:27,236 INFO L225 Difference]: With dead ends: 18638 [2021-06-05 17:53:27,237 INFO L226 Difference]: Without dead ends: 18638 [2021-06-05 17:53:27,237 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1096.5ms TimeCoverageRelationStatistics Valid=413, Invalid=1227, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 17:53:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18638 states. [2021-06-05 17:53:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18638 to 14275. [2021-06-05 17:53:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14275 states, 14273 states have (on average 2.753520633363694) internal successors, (39301), 14274 states have internal predecessors, (39301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14275 states to 14275 states and 39301 transitions. [2021-06-05 17:53:27,685 INFO L78 Accepts]: Start accepts. Automaton has 14275 states and 39301 transitions. Word has length 105 [2021-06-05 17:53:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:27,685 INFO L482 AbstractCegarLoop]: Abstraction has 14275 states and 39301 transitions. [2021-06-05 17:53:27,685 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 14275 states and 39301 transitions. [2021-06-05 17:53:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 17:53:27,701 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:27,701 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:27,702 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 17:53:27,702 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash 558943188, now seen corresponding path program 4 times [2021-06-05 17:53:27,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:27,703 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092896046] [2021-06-05 17:53:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:28,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:28,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092896046] [2021-06-05 17:53:28,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092896046] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:28,087 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:28,087 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-05 17:53:28,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266980444] [2021-06-05 17:53:28,087 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 17:53:28,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:28,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 17:53:28,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 17:53:28,088 INFO L87 Difference]: Start difference. First operand 14275 states and 39301 transitions. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:29,043 INFO L93 Difference]: Finished difference Result 16528 states and 45530 transitions. [2021-06-05 17:53:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 17:53:29,044 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 17:53:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:29,068 INFO L225 Difference]: With dead ends: 16528 [2021-06-05 17:53:29,068 INFO L226 Difference]: Without dead ends: 16528 [2021-06-05 17:53:29,069 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 799.1ms TimeCoverageRelationStatistics Valid=257, Invalid=799, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 17:53:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16528 states. [2021-06-05 17:53:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16528 to 14057. [2021-06-05 17:53:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14057 states, 14055 states have (on average 2.7540377090003556) internal successors, (38708), 14056 states have internal predecessors, (38708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14057 states to 14057 states and 38708 transitions. [2021-06-05 17:53:29,376 INFO L78 Accepts]: Start accepts. Automaton has 14057 states and 38708 transitions. Word has length 105 [2021-06-05 17:53:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:29,377 INFO L482 AbstractCegarLoop]: Abstraction has 14057 states and 38708 transitions. [2021-06-05 17:53:29,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 14057 states and 38708 transitions. [2021-06-05 17:53:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 17:53:29,394 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:29,394 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:29,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 17:53:29,395 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:29,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash -689257618, now seen corresponding path program 1 times [2021-06-05 17:53:29,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:29,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167997689] [2021-06-05 17:53:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:30,363 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:30,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167997689] [2021-06-05 17:53:30,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167997689] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:30,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:30,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 17:53:30,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186086500] [2021-06-05 17:53:30,364 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 17:53:30,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:30,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 17:53:30,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-06-05 17:53:30,365 INFO L87 Difference]: Start difference. First operand 14057 states and 38708 transitions. Second operand has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:33,220 INFO L93 Difference]: Finished difference Result 17898 states and 48925 transitions. [2021-06-05 17:53:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 17:53:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 17:53:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:33,241 INFO L225 Difference]: With dead ends: 17898 [2021-06-05 17:53:33,241 INFO L226 Difference]: Without dead ends: 16972 [2021-06-05 17:53:33,242 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2146.0ms TimeCoverageRelationStatistics Valid=522, Invalid=2340, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 17:53:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16972 states. [2021-06-05 17:53:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16972 to 15388. [2021-06-05 17:53:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15388 states, 15386 states have (on average 2.755297023267906) internal successors, (42393), 15387 states have internal predecessors, (42393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15388 states to 15388 states and 42393 transitions. [2021-06-05 17:53:33,576 INFO L78 Accepts]: Start accepts. Automaton has 15388 states and 42393 transitions. Word has length 109 [2021-06-05 17:53:33,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:33,576 INFO L482 AbstractCegarLoop]: Abstraction has 15388 states and 42393 transitions. [2021-06-05 17:53:33,576 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 15388 states and 42393 transitions. [2021-06-05 17:53:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 17:53:33,585 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:33,585 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:33,585 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 17:53:33,585 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash 898788268, now seen corresponding path program 2 times [2021-06-05 17:53:33,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:33,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819735502] [2021-06-05 17:53:33,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:34,397 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:34,397 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819735502] [2021-06-05 17:53:34,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819735502] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:34,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:34,397 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 17:53:34,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394621551] [2021-06-05 17:53:34,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 17:53:34,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:34,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 17:53:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-06-05 17:53:34,399 INFO L87 Difference]: Start difference. First operand 15388 states and 42393 transitions. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:37,745 INFO L93 Difference]: Finished difference Result 19669 states and 53600 transitions. [2021-06-05 17:53:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 17:53:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 17:53:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:37,767 INFO L225 Difference]: With dead ends: 19669 [2021-06-05 17:53:37,767 INFO L226 Difference]: Without dead ends: 19283 [2021-06-05 17:53:37,768 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2603.3ms TimeCoverageRelationStatistics Valid=675, Invalid=2865, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 17:53:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19283 states. [2021-06-05 17:53:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19283 to 15394. [2021-06-05 17:53:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15394 states, 15392 states have (on average 2.755002598752599) internal successors, (42405), 15393 states have internal predecessors, (42405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15394 states to 15394 states and 42405 transitions. [2021-06-05 17:53:38,068 INFO L78 Accepts]: Start accepts. Automaton has 15394 states and 42405 transitions. Word has length 109 [2021-06-05 17:53:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:38,068 INFO L482 AbstractCegarLoop]: Abstraction has 15394 states and 42405 transitions. [2021-06-05 17:53:38,069 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 15394 states and 42405 transitions. [2021-06-05 17:53:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 17:53:38,077 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:38,077 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:38,077 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 17:53:38,078 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:38,078 INFO L82 PathProgramCache]: Analyzing trace with hash 152158104, now seen corresponding path program 3 times [2021-06-05 17:53:38,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:38,078 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164646544] [2021-06-05 17:53:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:38,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:38,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164646544] [2021-06-05 17:53:38,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164646544] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:38,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:38,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 17:53:38,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78534052] [2021-06-05 17:53:38,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 17:53:38,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:38,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 17:53:38,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-06-05 17:53:38,774 INFO L87 Difference]: Start difference. First operand 15394 states and 42405 transitions. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:41,666 INFO L93 Difference]: Finished difference Result 19221 states and 52364 transitions. [2021-06-05 17:53:41,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 17:53:41,667 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 17:53:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:41,687 INFO L225 Difference]: With dead ends: 19221 [2021-06-05 17:53:41,688 INFO L226 Difference]: Without dead ends: 18880 [2021-06-05 17:53:41,689 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2320.7ms TimeCoverageRelationStatistics Valid=669, Invalid=2871, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 17:53:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18880 states. [2021-06-05 17:53:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18880 to 15396. [2021-06-05 17:53:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15396 states, 15394 states have (on average 2.7549045082499677) internal successors, (42409), 15395 states have internal predecessors, (42409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15396 states to 15396 states and 42409 transitions. [2021-06-05 17:53:41,971 INFO L78 Accepts]: Start accepts. Automaton has 15396 states and 42409 transitions. Word has length 109 [2021-06-05 17:53:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:41,971 INFO L482 AbstractCegarLoop]: Abstraction has 15396 states and 42409 transitions. [2021-06-05 17:53:41,972 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 15396 states and 42409 transitions. [2021-06-05 17:53:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 17:53:41,980 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:41,981 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:41,981 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 17:53:41,981 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash 499057264, now seen corresponding path program 4 times [2021-06-05 17:53:41,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:41,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452627711] [2021-06-05 17:53:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:42,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:42,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452627711] [2021-06-05 17:53:42,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452627711] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:42,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:42,824 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 17:53:42,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838377189] [2021-06-05 17:53:42,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 17:53:42,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 17:53:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-06-05 17:53:42,826 INFO L87 Difference]: Start difference. First operand 15396 states and 42409 transitions. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:45,781 INFO L93 Difference]: Finished difference Result 16059 states and 43958 transitions. [2021-06-05 17:53:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 17:53:45,781 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 17:53:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:45,798 INFO L225 Difference]: With dead ends: 16059 [2021-06-05 17:53:45,798 INFO L226 Difference]: Without dead ends: 15673 [2021-06-05 17:53:45,799 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2408.3ms TimeCoverageRelationStatistics Valid=583, Invalid=2497, Unknown=0, NotChecked=0, Total=3080 [2021-06-05 17:53:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15673 states. [2021-06-05 17:53:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15673 to 15180. [2021-06-05 17:53:45,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15180 states, 15178 states have (on average 2.757016734747661) internal successors, (41846), 15179 states have internal predecessors, (41846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15180 states to 15180 states and 41846 transitions. [2021-06-05 17:53:45,994 INFO L78 Accepts]: Start accepts. Automaton has 15180 states and 41846 transitions. Word has length 109 [2021-06-05 17:53:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:45,994 INFO L482 AbstractCegarLoop]: Abstraction has 15180 states and 41846 transitions. [2021-06-05 17:53:45,994 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15180 states and 41846 transitions. [2021-06-05 17:53:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-06-05 17:53:46,006 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:46,007 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:46,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 17:53:46,007 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash 645774088, now seen corresponding path program 1 times [2021-06-05 17:53:46,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:46,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058528821] [2021-06-05 17:53:46,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:46,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:46,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058528821] [2021-06-05 17:53:46,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058528821] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:46,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:46,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 17:53:46,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761741369] [2021-06-05 17:53:46,036 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 17:53:46,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:46,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 17:53:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:53:46,037 INFO L87 Difference]: Start difference. First operand 15180 states and 41846 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:46,066 INFO L93 Difference]: Finished difference Result 4413 states and 11171 transitions. [2021-06-05 17:53:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 17:53:46,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2021-06-05 17:53:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:46,070 INFO L225 Difference]: With dead ends: 4413 [2021-06-05 17:53:46,070 INFO L226 Difference]: Without dead ends: 2943 [2021-06-05 17:53:46,070 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:53:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2021-06-05 17:53:46,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2735. [2021-06-05 17:53:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2733 states have (on average 2.538968166849616) internal successors, (6939), 2734 states have internal predecessors, (6939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 6939 transitions. [2021-06-05 17:53:46,104 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 6939 transitions. Word has length 126 [2021-06-05 17:53:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:46,105 INFO L482 AbstractCegarLoop]: Abstraction has 2735 states and 6939 transitions. [2021-06-05 17:53:46,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 6939 transitions. [2021-06-05 17:53:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-06-05 17:53:46,109 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:46,109 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:46,109 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 17:53:46,109 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:46,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1909541098, now seen corresponding path program 1 times [2021-06-05 17:53:46,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:46,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708526408] [2021-06-05 17:53:46,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:46,144 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:46,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708526408] [2021-06-05 17:53:46,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708526408] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:46,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:46,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 17:53:46,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010253060] [2021-06-05 17:53:46,145 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 17:53:46,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:46,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 17:53:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:53:46,146 INFO L87 Difference]: Start difference. First operand 2735 states and 6939 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:46,164 INFO L93 Difference]: Finished difference Result 253 states and 535 transitions. [2021-06-05 17:53:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 17:53:46,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-06-05 17:53:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:46,165 INFO L225 Difference]: With dead ends: 253 [2021-06-05 17:53:46,165 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 17:53:46,166 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:53:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 17:53:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 17:53:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 17:53:46,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2021-06-05 17:53:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:46,167 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 17:53:46,167 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 17:53:46,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 17:53:46,167 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 17:53:46,168 INFO L301 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/5) [2021-06-05 17:53:46,170 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 17:53:46,171 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 17:53:46,171 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 17:53:46,171 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 17:53:46,171 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 17:53:46,171 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 17:53:46,171 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 17:53:46,171 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 17:53:46,171 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 17:53:46,179 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 17:53:46,942 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 17:53:46,974 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:46,974 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:46,974 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:46,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:46,974 INFO L82 PathProgramCache]: Analyzing trace with hash 846969469, now seen corresponding path program 1 times [2021-06-05 17:53:46,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:46,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347475162] [2021-06-05 17:53:46,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:46,987 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:46,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347475162] [2021-06-05 17:53:46,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347475162] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:46,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:46,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 17:53:46,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873735261] [2021-06-05 17:53:46,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 17:53:46,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:46,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 17:53:46,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 17:53:47,024 INFO L87 Difference]: Start difference. First operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:47,111 INFO L93 Difference]: Finished difference Result 23006 states and 64260 transitions. [2021-06-05 17:53:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 17:53:47,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 17:53:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:47,111 INFO L225 Difference]: With dead ends: 23006 [2021-06-05 17:53:47,111 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 17:53:47,111 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 17:53:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 17:53:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 17:53:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 17:53:47,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2021-06-05 17:53:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:47,112 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 17:53:47,112 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 17:53:47,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 17:53:47,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 17:53:47,112 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (2/5) [2021-06-05 17:53:47,112 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 17:53:47,113 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 17:53:47,113 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 17:53:47,113 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 17:53:47,113 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 17:53:47,113 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 17:53:47,113 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 17:53:47,113 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 17:53:47,113 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2Thread1of1ForFork1======== [2021-06-05 17:53:47,115 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 17:53:47,641 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-05 17:53:47,686 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:47,686 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:47,686 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1005029651, now seen corresponding path program 1 times [2021-06-05 17:53:47,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:47,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638869997] [2021-06-05 17:53:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:47,785 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:47,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638869997] [2021-06-05 17:53:47,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638869997] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:47,785 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:47,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 17:53:47,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40134812] [2021-06-05 17:53:47,786 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 17:53:47,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 17:53:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 17:53:47,823 INFO L87 Difference]: Start difference. First operand has 23654 states, 23649 states have (on average 2.8479428305636603) internal successors, (67351), 23653 states have internal predecessors, (67351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:48,223 INFO L93 Difference]: Finished difference Result 23003 states and 64256 transitions. [2021-06-05 17:53:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 17:53:48,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-06-05 17:53:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:48,259 INFO L225 Difference]: With dead ends: 23003 [2021-06-05 17:53:48,260 INFO L226 Difference]: Without dead ends: 21410 [2021-06-05 17:53:48,260 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 206.6ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-05 17:53:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21410 states. [2021-06-05 17:53:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21410 to 21410. [2021-06-05 17:53:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21410 states, 21408 states have (on average 2.8053998505231688) internal successors, (60058), 21409 states have internal predecessors, (60058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 60058 transitions. [2021-06-05 17:53:48,651 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 60058 transitions. Word has length 92 [2021-06-05 17:53:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:48,651 INFO L482 AbstractCegarLoop]: Abstraction has 21410 states and 60058 transitions. [2021-06-05 17:53:48,651 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 60058 transitions. [2021-06-05 17:53:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 17:53:48,656 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:48,656 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:48,656 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 17:53:48,656 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:48,656 INFO L82 PathProgramCache]: Analyzing trace with hash -588297784, now seen corresponding path program 1 times [2021-06-05 17:53:48,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:48,656 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162367256] [2021-06-05 17:53:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:48,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:48,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162367256] [2021-06-05 17:53:48,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162367256] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:48,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:48,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 17:53:48,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889294348] [2021-06-05 17:53:48,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 17:53:48,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 17:53:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:53:48,686 INFO L87 Difference]: Start difference. First operand 21410 states and 60058 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:48,740 INFO L93 Difference]: Finished difference Result 14550 states and 40132 transitions. [2021-06-05 17:53:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 17:53:48,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-06-05 17:53:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:48,762 INFO L225 Difference]: With dead ends: 14550 [2021-06-05 17:53:48,762 INFO L226 Difference]: Without dead ends: 14107 [2021-06-05 17:53:48,763 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:53:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14107 states. [2021-06-05 17:53:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14107 to 14107. [2021-06-05 17:53:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14107 states, 14106 states have (on average 2.7586842478377993) internal successors, (38914), 14106 states have internal predecessors, (38914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 38914 transitions. [2021-06-05 17:53:48,976 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 38914 transitions. Word has length 93 [2021-06-05 17:53:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:48,976 INFO L482 AbstractCegarLoop]: Abstraction has 14107 states and 38914 transitions. [2021-06-05 17:53:48,976 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 38914 transitions. [2021-06-05 17:53:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-06-05 17:53:48,988 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:48,988 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:48,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 17:53:48,988 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2001910818, now seen corresponding path program 1 times [2021-06-05 17:53:48,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:48,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99447233] [2021-06-05 17:53:48,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:49,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:49,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99447233] [2021-06-05 17:53:49,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99447233] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:49,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:49,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 17:53:49,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939852344] [2021-06-05 17:53:49,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 17:53:49,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:49,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 17:53:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:53:49,019 INFO L87 Difference]: Start difference. First operand 14107 states and 38914 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:49,053 INFO L93 Difference]: Finished difference Result 6968 states and 17928 transitions. [2021-06-05 17:53:49,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 17:53:49,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2021-06-05 17:53:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:49,063 INFO L225 Difference]: With dead ends: 6968 [2021-06-05 17:53:49,063 INFO L226 Difference]: Without dead ends: 6968 [2021-06-05 17:53:49,063 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 17:53:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6968 states. [2021-06-05 17:53:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6968 to 5714. [2021-06-05 17:53:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5714 states, 5712 states have (on average 2.5773809523809526) internal successors, (14722), 5713 states have internal predecessors, (14722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5714 states to 5714 states and 14722 transitions. [2021-06-05 17:53:49,132 INFO L78 Accepts]: Start accepts. Automaton has 5714 states and 14722 transitions. Word has length 171 [2021-06-05 17:53:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:49,133 INFO L482 AbstractCegarLoop]: Abstraction has 5714 states and 14722 transitions. [2021-06-05 17:53:49,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 5714 states and 14722 transitions. [2021-06-05 17:53:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-05 17:53:49,139 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:49,140 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:49,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 17:53:49,140 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:49,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1638330135, now seen corresponding path program 1 times [2021-06-05 17:53:49,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:49,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396461101] [2021-06-05 17:53:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:49,793 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:49,793 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396461101] [2021-06-05 17:53:49,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396461101] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:49,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:49,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 17:53:49,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229297999] [2021-06-05 17:53:49,794 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 17:53:49,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 17:53:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2021-06-05 17:53:49,795 INFO L87 Difference]: Start difference. First operand 5714 states and 14722 transitions. Second operand has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 29 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:51,727 INFO L93 Difference]: Finished difference Result 10116 states and 26169 transitions. [2021-06-05 17:53:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 17:53:51,727 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 29 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2021-06-05 17:53:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:51,738 INFO L225 Difference]: With dead ends: 10116 [2021-06-05 17:53:51,738 INFO L226 Difference]: Without dead ends: 10116 [2021-06-05 17:53:51,739 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1737.2ms TimeCoverageRelationStatistics Valid=520, Invalid=2342, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 17:53:51,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2021-06-05 17:53:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 8359. [2021-06-05 17:53:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8359 states, 8357 states have (on average 2.592916118224243) internal successors, (21669), 8358 states have internal predecessors, (21669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 21669 transitions. [2021-06-05 17:53:51,842 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 21669 transitions. Word has length 172 [2021-06-05 17:53:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:51,842 INFO L482 AbstractCegarLoop]: Abstraction has 8359 states and 21669 transitions. [2021-06-05 17:53:51,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 29 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 21669 transitions. [2021-06-05 17:53:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-06-05 17:53:51,850 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:51,850 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:51,850 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 17:53:51,851 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:51,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:51,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2053314793, now seen corresponding path program 2 times [2021-06-05 17:53:51,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:51,851 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394939874] [2021-06-05 17:53:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:52,065 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:52,065 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394939874] [2021-06-05 17:53:52,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394939874] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:52,065 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:52,065 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 17:53:52,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720501161] [2021-06-05 17:53:52,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 17:53:52,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:52,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 17:53:52,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 17:53:52,066 INFO L87 Difference]: Start difference. First operand 8359 states and 21669 transitions. Second operand has 16 states, 16 states have (on average 10.75) internal successors, (172), 16 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:52,844 INFO L93 Difference]: Finished difference Result 7534 states and 19551 transitions. [2021-06-05 17:53:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 17:53:52,844 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.75) internal successors, (172), 16 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2021-06-05 17:53:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:52,855 INFO L225 Difference]: With dead ends: 7534 [2021-06-05 17:53:52,855 INFO L226 Difference]: Without dead ends: 7534 [2021-06-05 17:53:52,856 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 548.4ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-06-05 17:53:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2021-06-05 17:53:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 7513. [2021-06-05 17:53:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7513 states, 7511 states have (on average 2.59592597523632) internal successors, (19498), 7512 states have internal predecessors, (19498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 19498 transitions. [2021-06-05 17:53:52,974 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 19498 transitions. Word has length 172 [2021-06-05 17:53:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:52,974 INFO L482 AbstractCegarLoop]: Abstraction has 7513 states and 19498 transitions. [2021-06-05 17:53:52,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 10.75) internal successors, (172), 16 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 19498 transitions. [2021-06-05 17:53:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 17:53:52,985 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:52,985 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:52,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 17:53:52,985 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash -81803076, now seen corresponding path program 1 times [2021-06-05 17:53:52,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:52,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983018658] [2021-06-05 17:53:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:53,634 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2021-06-05 17:53:53,794 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2021-06-05 17:53:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:54,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:54,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983018658] [2021-06-05 17:53:54,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983018658] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:54,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:54,724 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 17:53:54,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957309196] [2021-06-05 17:53:54,724 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 17:53:54,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:54,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 17:53:54,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-05 17:53:54,725 INFO L87 Difference]: Start difference. First operand 7513 states and 19498 transitions. Second operand has 21 states, 21 states have (on average 8.380952380952381) internal successors, (176), 21 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:56,546 INFO L93 Difference]: Finished difference Result 7672 states and 19802 transitions. [2021-06-05 17:53:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 17:53:56,546 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.380952380952381) internal successors, (176), 21 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-06-05 17:53:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:56,554 INFO L225 Difference]: With dead ends: 7672 [2021-06-05 17:53:56,554 INFO L226 Difference]: Without dead ends: 7672 [2021-06-05 17:53:56,555 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2284.3ms TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 17:53:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2021-06-05 17:53:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 7462. [2021-06-05 17:53:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7462 states, 7460 states have (on average 2.583378016085791) internal successors, (19272), 7461 states have internal predecessors, (19272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7462 states to 7462 states and 19272 transitions. [2021-06-05 17:53:56,632 INFO L78 Accepts]: Start accepts. Automaton has 7462 states and 19272 transitions. Word has length 176 [2021-06-05 17:53:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:56,632 INFO L482 AbstractCegarLoop]: Abstraction has 7462 states and 19272 transitions. [2021-06-05 17:53:56,632 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 8.380952380952381) internal successors, (176), 21 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 7462 states and 19272 transitions. [2021-06-05 17:53:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 17:53:56,638 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:56,639 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:56,639 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 17:53:56,639 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1262899971, now seen corresponding path program 1 times [2021-06-05 17:53:56,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:56,639 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546458102] [2021-06-05 17:53:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:53:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:53:57,325 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:53:57,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546458102] [2021-06-05 17:53:57,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546458102] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:53:57,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:53:57,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 17:53:57,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775320421] [2021-06-05 17:53:57,326 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 17:53:57,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:53:57,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 17:53:57,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-06-05 17:53:57,326 INFO L87 Difference]: Start difference. First operand 7462 states and 19272 transitions. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:53:59,764 INFO L93 Difference]: Finished difference Result 7450 states and 19113 transitions. [2021-06-05 17:53:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 17:53:59,765 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-06-05 17:53:59,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:53:59,772 INFO L225 Difference]: With dead ends: 7450 [2021-06-05 17:53:59,772 INFO L226 Difference]: Without dead ends: 7450 [2021-06-05 17:53:59,773 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2170.3ms TimeCoverageRelationStatistics Valid=742, Invalid=2918, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 17:53:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7450 states. [2021-06-05 17:53:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7450 to 6542. [2021-06-05 17:53:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 6540 states have (on average 2.5720183486238533) internal successors, (16821), 6541 states have internal predecessors, (16821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 16821 transitions. [2021-06-05 17:53:59,845 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 16821 transitions. Word has length 176 [2021-06-05 17:53:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:53:59,846 INFO L482 AbstractCegarLoop]: Abstraction has 6542 states and 16821 transitions. [2021-06-05 17:53:59,846 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:53:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 16821 transitions. [2021-06-05 17:53:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 17:53:59,850 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:53:59,851 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:53:59,851 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 17:53:59,851 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:53:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:53:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1764052017, now seen corresponding path program 2 times [2021-06-05 17:53:59,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:53:59,851 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071789610] [2021-06-05 17:53:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:53:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:54:00,911 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 17:54:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:54:01,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:54:01,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071789610] [2021-06-05 17:54:01,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071789610] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:54:01,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:54:01,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 17:54:01,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486927150] [2021-06-05 17:54:01,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 17:54:01,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:54:01,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 17:54:01,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2021-06-05 17:54:01,797 INFO L87 Difference]: Start difference. First operand 6542 states and 16821 transitions. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:03,014 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2021-06-05 17:54:03,224 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2021-06-05 17:54:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:54:07,667 INFO L93 Difference]: Finished difference Result 11156 states and 28686 transitions. [2021-06-05 17:54:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 17:54:07,667 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-06-05 17:54:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:54:07,680 INFO L225 Difference]: With dead ends: 11156 [2021-06-05 17:54:07,680 INFO L226 Difference]: Without dead ends: 11156 [2021-06-05 17:54:07,682 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 5285.6ms TimeCoverageRelationStatistics Valid=1093, Invalid=5069, Unknown=0, NotChecked=0, Total=6162 [2021-06-05 17:54:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11156 states. [2021-06-05 17:54:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11156 to 7145. [2021-06-05 17:54:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7145 states, 7143 states have (on average 2.590228195436091) internal successors, (18502), 7144 states have internal predecessors, (18502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 18502 transitions. [2021-06-05 17:54:07,784 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 18502 transitions. Word has length 176 [2021-06-05 17:54:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:54:07,785 INFO L482 AbstractCegarLoop]: Abstraction has 7145 states and 18502 transitions. [2021-06-05 17:54:07,785 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 18502 transitions. [2021-06-05 17:54:07,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 17:54:07,792 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:54:07,792 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:54:07,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 17:54:07,792 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:54:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:54:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash -158385587, now seen corresponding path program 3 times [2021-06-05 17:54:07,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:54:07,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742055919] [2021-06-05 17:54:07,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:54:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:54:08,277 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2021-06-05 17:54:09,377 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 17:54:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:54:10,668 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:54:10,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742055919] [2021-06-05 17:54:10,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742055919] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:54:10,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:54:10,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 17:54:10,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657302550] [2021-06-05 17:54:10,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 17:54:10,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:54:10,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 17:54:10,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-06-05 17:54:10,669 INFO L87 Difference]: Start difference. First operand 7145 states and 18502 transitions. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:12,664 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2021-06-05 17:54:13,014 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2021-06-05 17:54:13,393 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-06-05 17:54:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:54:15,466 INFO L93 Difference]: Finished difference Result 8881 states and 22910 transitions. [2021-06-05 17:54:15,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 17:54:15,466 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-06-05 17:54:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:54:15,475 INFO L225 Difference]: With dead ends: 8881 [2021-06-05 17:54:15,476 INFO L226 Difference]: Without dead ends: 8881 [2021-06-05 17:54:15,477 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 5908.3ms TimeCoverageRelationStatistics Valid=840, Invalid=3716, Unknown=0, NotChecked=0, Total=4556 [2021-06-05 17:54:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8881 states. [2021-06-05 17:54:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8881 to 7149. [2021-06-05 17:54:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7149 states, 7147 states have (on average 2.5898978592416397) internal successors, (18510), 7148 states have internal predecessors, (18510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7149 states to 7149 states and 18510 transitions. [2021-06-05 17:54:15,557 INFO L78 Accepts]: Start accepts. Automaton has 7149 states and 18510 transitions. Word has length 176 [2021-06-05 17:54:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:54:15,557 INFO L482 AbstractCegarLoop]: Abstraction has 7149 states and 18510 transitions. [2021-06-05 17:54:15,557 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7149 states and 18510 transitions. [2021-06-05 17:54:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-05 17:54:15,564 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:54:15,564 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:54:15,564 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 17:54:15,564 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:54:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:54:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1162695829, now seen corresponding path program 4 times [2021-06-05 17:54:15,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:54:15,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307034962] [2021-06-05 17:54:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:54:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:54:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:54:16,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:54:16,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307034962] [2021-06-05 17:54:16,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307034962] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:54:16,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:54:16,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-06-05 17:54:16,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693381299] [2021-06-05 17:54:16,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-06-05 17:54:16,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:54:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-06-05 17:54:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 17:54:16,639 INFO L87 Difference]: Start difference. First operand 7149 states and 18510 transitions. Second operand has 37 states, 37 states have (on average 4.756756756756757) internal successors, (176), 37 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:54:20,331 INFO L93 Difference]: Finished difference Result 11879 states and 30874 transitions. [2021-06-05 17:54:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 17:54:20,331 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.756756756756757) internal successors, (176), 37 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-06-05 17:54:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:54:20,344 INFO L225 Difference]: With dead ends: 11879 [2021-06-05 17:54:20,344 INFO L226 Difference]: Without dead ends: 11879 [2021-06-05 17:54:20,345 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 3537.7ms TimeCoverageRelationStatistics Valid=1144, Invalid=4708, Unknown=0, NotChecked=0, Total=5852 [2021-06-05 17:54:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2021-06-05 17:54:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 10000. [2021-06-05 17:54:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10000 states, 9998 states have (on average 2.608621724344869) internal successors, (26081), 9999 states have internal predecessors, (26081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10000 states to 10000 states and 26081 transitions. [2021-06-05 17:54:20,467 INFO L78 Accepts]: Start accepts. Automaton has 10000 states and 26081 transitions. Word has length 176 [2021-06-05 17:54:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:54:20,468 INFO L482 AbstractCegarLoop]: Abstraction has 10000 states and 26081 transitions. [2021-06-05 17:54:20,468 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 4.756756756756757) internal successors, (176), 37 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 10000 states and 26081 transitions. [2021-06-05 17:54:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-05 17:54:20,476 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:54:20,476 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:54:20,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 17:54:20,476 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:54:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:54:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash -575763056, now seen corresponding path program 1 times [2021-06-05 17:54:20,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:54:20,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561022628] [2021-06-05 17:54:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:54:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:54:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:54:21,106 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:54:21,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561022628] [2021-06-05 17:54:21,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561022628] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:54:21,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:54:21,107 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 17:54:21,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890200705] [2021-06-05 17:54:21,107 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 17:54:21,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:54:21,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 17:54:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2021-06-05 17:54:21,108 INFO L87 Difference]: Start difference. First operand 10000 states and 26081 transitions. Second operand has 29 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:54:23,976 INFO L93 Difference]: Finished difference Result 14273 states and 37070 transitions. [2021-06-05 17:54:23,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 17:54:23,977 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-06-05 17:54:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:54:23,992 INFO L225 Difference]: With dead ends: 14273 [2021-06-05 17:54:23,993 INFO L226 Difference]: Without dead ends: 14273 [2021-06-05 17:54:23,994 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2482.0ms TimeCoverageRelationStatistics Valid=951, Invalid=3339, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 17:54:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2021-06-05 17:54:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 10016. [2021-06-05 17:54:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10016 states, 10014 states have (on average 2.6076492909926103) internal successors, (26113), 10015 states have internal predecessors, (26113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10016 states to 10016 states and 26113 transitions. [2021-06-05 17:54:24,122 INFO L78 Accepts]: Start accepts. Automaton has 10016 states and 26113 transitions. Word has length 180 [2021-06-05 17:54:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:54:24,123 INFO L482 AbstractCegarLoop]: Abstraction has 10016 states and 26113 transitions. [2021-06-05 17:54:24,123 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 6.206896551724138) internal successors, (180), 29 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 10016 states and 26113 transitions. [2021-06-05 17:54:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-06-05 17:54:24,131 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:54:24,131 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:54:24,131 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 17:54:24,131 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:54:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:54:24,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1316382846, now seen corresponding path program 2 times [2021-06-05 17:54:24,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:54:24,132 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552296498] [2021-06-05 17:54:24,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:54:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:54:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:54:24,750 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:54:24,750 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552296498] [2021-06-05 17:54:24,750 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552296498] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:54:24,750 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:54:24,750 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 17:54:24,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554942754] [2021-06-05 17:54:24,750 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 17:54:24,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:54:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 17:54:24,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-06-05 17:54:24,751 INFO L87 Difference]: Start difference. First operand 10016 states and 26113 transitions. Second operand has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:25,738 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2021-06-05 17:54:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:54:26,607 INFO L93 Difference]: Finished difference Result 8582 states and 22084 transitions. [2021-06-05 17:54:26,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 17:54:26,607 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-06-05 17:54:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:54:26,615 INFO L225 Difference]: With dead ends: 8582 [2021-06-05 17:54:26,615 INFO L226 Difference]: Without dead ends: 8582 [2021-06-05 17:54:26,616 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1731.6ms TimeCoverageRelationStatistics Valid=610, Invalid=2146, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:54:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8582 states. [2021-06-05 17:54:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8582 to 8178. [2021-06-05 17:54:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8178 states, 8176 states have (on average 2.5780332681017613) internal successors, (21078), 8177 states have internal predecessors, (21078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 21078 transitions. [2021-06-05 17:54:26,702 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 21078 transitions. Word has length 180 [2021-06-05 17:54:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:54:26,702 INFO L482 AbstractCegarLoop]: Abstraction has 8178 states and 21078 transitions. [2021-06-05 17:54:26,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 21078 transitions. [2021-06-05 17:54:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:54:26,709 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:54:26,709 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:54:26,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 17:54:26,709 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:54:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:54:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1724116409, now seen corresponding path program 1 times [2021-06-05 17:54:26,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:54:26,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061654112] [2021-06-05 17:54:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:54:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:54:27,415 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:54:27,632 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 17:54:27,784 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 17:54:27,926 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 17:54:28,915 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-05 17:54:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:54:31,494 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:54:31,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061654112] [2021-06-05 17:54:31,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061654112] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:54:31,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:54:31,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:54:31,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689797545] [2021-06-05 17:54:31,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:54:31,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:54:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:54:31,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:54:31,495 INFO L87 Difference]: Start difference. First operand 8178 states and 21078 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:35,078 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 17:54:35,674 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 17:54:38,986 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:54:39,317 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:54:42,424 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:54:45,998 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:54:47,255 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-06-05 17:54:48,267 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:54:49,011 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:54:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:54:49,702 INFO L93 Difference]: Finished difference Result 12591 states and 32503 transitions. [2021-06-05 17:54:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 17:54:49,703 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:54:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:54:49,716 INFO L225 Difference]: With dead ends: 12591 [2021-06-05 17:54:49,716 INFO L226 Difference]: Without dead ends: 12171 [2021-06-05 17:54:49,717 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4491 ImplicationChecksByTransitivity, 14065.0ms TimeCoverageRelationStatistics Valid=1530, Invalid=14982, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 17:54:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2021-06-05 17:54:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 9590. [2021-06-05 17:54:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 17:54:49,824 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 17:54:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:54:49,825 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 17:54:49,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 17:54:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:54:49,832 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:54:49,832 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:54:49,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 17:54:49,832 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:54:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:54:49,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1443982125, now seen corresponding path program 2 times [2021-06-05 17:54:49,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:54:49,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111030645] [2021-06-05 17:54:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:54:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:54:50,482 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:54:51,752 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:54:51,933 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-06-05 17:54:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:54:54,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:54:54,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111030645] [2021-06-05 17:54:54,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111030645] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:54:54,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:54:54,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:54:54,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743829564] [2021-06-05 17:54:54,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:54:54,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:54:54,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:54:54,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2574, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:54:54,710 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:54:58,784 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 17:54:59,540 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 17:55:01,095 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-06-05 17:55:03,508 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:55:03,865 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:55:04,272 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 17:55:07,295 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:55:09,153 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2021-06-05 17:55:10,188 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:55:12,028 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:55:12,880 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:55:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:55:13,569 INFO L93 Difference]: Finished difference Result 14115 states and 36317 transitions. [2021-06-05 17:55:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 17:55:13,570 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:55:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:55:13,588 INFO L225 Difference]: With dead ends: 14115 [2021-06-05 17:55:13,588 INFO L226 Difference]: Without dead ends: 13695 [2021-06-05 17:55:13,590 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4545 ImplicationChecksByTransitivity, 14696.4ms TimeCoverageRelationStatistics Valid=1548, Invalid=15222, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 17:55:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13695 states. [2021-06-05 17:55:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13695 to 9590. [2021-06-05 17:55:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:55:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 17:55:13,736 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 17:55:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:55:13,737 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 17:55:13,737 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:55:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 17:55:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:55:13,746 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:55:13,746 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:55:13,747 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 17:55:13,747 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:55:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:55:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash -679804985, now seen corresponding path program 3 times [2021-06-05 17:55:13,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:55:13,747 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574200897] [2021-06-05 17:55:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:55:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:55:14,354 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:55:15,753 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:55:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:55:18,805 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:55:18,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574200897] [2021-06-05 17:55:18,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574200897] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:55:18,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:55:18,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:55:18,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105316251] [2021-06-05 17:55:18,806 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:55:18,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:55:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:55:18,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:55:18,807 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:55:23,694 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2021-06-05 17:55:24,540 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 17:55:25,352 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 17:55:27,179 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2021-06-05 17:55:30,945 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:55:31,415 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:55:34,121 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:55:36,474 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:55:38,735 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:55:39,829 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:55:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:55:40,915 INFO L93 Difference]: Finished difference Result 14179 states and 36477 transitions. [2021-06-05 17:55:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 17:55:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:55:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:55:40,931 INFO L225 Difference]: With dead ends: 14179 [2021-06-05 17:55:40,931 INFO L226 Difference]: Without dead ends: 13759 [2021-06-05 17:55:40,933 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4712 ImplicationChecksByTransitivity, 15959.4ms TimeCoverageRelationStatistics Valid=1591, Invalid=15701, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 17:55:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13759 states. [2021-06-05 17:55:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13759 to 9590. [2021-06-05 17:55:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:55:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 17:55:41,068 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 17:55:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:55:41,068 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 17:55:41,069 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:55:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 17:55:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:55:41,080 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:55:41,080 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:55:41,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 17:55:41,081 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:55:41,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:55:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash 99175469, now seen corresponding path program 4 times [2021-06-05 17:55:41,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:55:41,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95463868] [2021-06-05 17:55:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:55:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:55:41,792 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:55:43,731 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:55:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:55:47,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:55:47,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95463868] [2021-06-05 17:55:47,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95463868] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:55:47,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:55:47,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:55:47,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597733824] [2021-06-05 17:55:47,929 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:55:47,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:55:47,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:55:47,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:55:47,930 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:55:55,366 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 17:55:55,757 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 17:55:56,665 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2021-06-05 17:55:58,368 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:55:58,631 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:56:00,914 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:56:03,362 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:56:05,712 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:56:06,816 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:56:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:56:07,984 INFO L93 Difference]: Finished difference Result 14163 states and 36441 transitions. [2021-06-05 17:56:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-05 17:56:07,984 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:56:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:56:08,001 INFO L225 Difference]: With dead ends: 14163 [2021-06-05 17:56:08,001 INFO L226 Difference]: Without dead ends: 13743 [2021-06-05 17:56:08,003 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4791 ImplicationChecksByTransitivity, 17207.9ms TimeCoverageRelationStatistics Valid=1618, Invalid=15938, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 17:56:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13743 states. [2021-06-05 17:56:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13743 to 9590. [2021-06-05 17:56:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:56:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 17:56:08,132 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 17:56:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:56:08,132 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 17:56:08,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:56:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 17:56:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:56:08,140 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:56:08,140 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:56:08,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 17:56:08,141 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:56:08,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:56:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1825177785, now seen corresponding path program 5 times [2021-06-05 17:56:08,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:56:08,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473037042] [2021-06-05 17:56:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:56:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:56:08,828 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:56:09,071 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 17:56:10,815 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:56:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:56:15,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:56:15,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473037042] [2021-06-05 17:56:15,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473037042] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:56:15,425 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:56:15,425 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:56:15,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576058863] [2021-06-05 17:56:15,425 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:56:15,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:56:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:56:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2580, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:56:15,426 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:56:18,280 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2021-06-05 17:56:18,614 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2021-06-05 17:56:19,871 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 17:56:20,652 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 17:56:21,011 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 17:56:21,567 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 17:56:22,093 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 72 [2021-06-05 17:56:24,814 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:56:25,100 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:56:27,409 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:56:29,902 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:56:32,237 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:56:33,320 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:56:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:56:34,264 INFO L93 Difference]: Finished difference Result 14267 states and 36697 transitions. [2021-06-05 17:56:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 17:56:34,264 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:56:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:56:34,280 INFO L225 Difference]: With dead ends: 14267 [2021-06-05 17:56:34,280 INFO L226 Difference]: Without dead ends: 13847 [2021-06-05 17:56:34,282 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5226 ImplicationChecksByTransitivity, 18196.4ms TimeCoverageRelationStatistics Valid=1734, Invalid=17172, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 17:56:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2021-06-05 17:56:34,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 9590. [2021-06-05 17:56:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9590 states, 9588 states have (on average 2.5602836879432624) internal successors, (24548), 9589 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:56:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9590 states to 9590 states and 24548 transitions. [2021-06-05 17:56:34,411 INFO L78 Accepts]: Start accepts. Automaton has 9590 states and 24548 transitions. Word has length 184 [2021-06-05 17:56:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:56:34,411 INFO L482 AbstractCegarLoop]: Abstraction has 9590 states and 24548 transitions. [2021-06-05 17:56:34,411 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:56:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 9590 states and 24548 transitions. [2021-06-05 17:56:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:56:34,419 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:56:34,419 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:56:34,419 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 17:56:34,419 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:56:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:56:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1959078739, now seen corresponding path program 6 times [2021-06-05 17:56:34,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:56:34,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119978551] [2021-06-05 17:56:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:56:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:56:34,995 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 17:56:35,291 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:56:35,523 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 17:56:35,871 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 17:56:36,107 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2021-06-05 17:56:36,279 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-05 17:56:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:56:39,315 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:56:39,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119978551] [2021-06-05 17:56:39,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119978551] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:56:39,315 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:56:39,315 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:56:39,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542170142] [2021-06-05 17:56:39,315 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:56:39,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:56:39,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:56:39,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2583, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:56:39,316 INFO L87 Difference]: Start difference. First operand 9590 states and 24548 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:56:42,287 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 17:56:42,818 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 17:56:44,391 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 17:56:44,806 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 17:56:45,507 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 17:56:46,259 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2021-06-05 17:56:49,813 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:56:50,205 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:56:50,628 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 17:56:54,065 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:56:58,239 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:57:01,161 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:57:02,015 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:57:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:02,756 INFO L93 Difference]: Finished difference Result 14179 states and 36499 transitions. [2021-06-05 17:57:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-05 17:57:02,756 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:57:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:02,769 INFO L225 Difference]: With dead ends: 14179 [2021-06-05 17:57:02,769 INFO L226 Difference]: Without dead ends: 13759 [2021-06-05 17:57:02,770 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4938 ImplicationChecksByTransitivity, 16197.5ms TimeCoverageRelationStatistics Valid=1656, Invalid=16434, Unknown=0, NotChecked=0, Total=18090 [2021-06-05 17:57:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13759 states. [2021-06-05 17:57:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13759 to 9668. [2021-06-05 17:57:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9668 states, 9666 states have (on average 2.5613490585557623) internal successors, (24758), 9667 states have internal predecessors, (24758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:57:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9668 states to 9668 states and 24758 transitions. [2021-06-05 17:57:02,883 INFO L78 Accepts]: Start accepts. Automaton has 9668 states and 24758 transitions. Word has length 184 [2021-06-05 17:57:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:02,883 INFO L482 AbstractCegarLoop]: Abstraction has 9668 states and 24758 transitions. [2021-06-05 17:57:02,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:57:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 9668 states and 24758 transitions. [2021-06-05 17:57:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:57:02,891 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:02,891 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:57:02,891 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 17:57:02,891 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:02,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:02,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1545636179, now seen corresponding path program 7 times [2021-06-05 17:57:02,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:02,892 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716528202] [2021-06-05 17:57:02,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:03,507 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:57:04,858 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:57:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:57:07,850 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:07,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716528202] [2021-06-05 17:57:07,851 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716528202] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:07,851 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:07,851 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:57:07,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775062947] [2021-06-05 17:57:07,851 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:57:07,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:07,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:57:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:57:07,852 INFO L87 Difference]: Start difference. First operand 9668 states and 24758 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:57:11,333 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 17:57:11,943 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 17:57:13,753 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 17:57:14,219 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 17:57:15,151 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2021-06-05 17:57:16,115 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2021-06-05 17:57:20,451 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:57:20,842 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:57:21,266 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 17:57:23,470 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2021-06-05 17:57:24,091 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:57:26,108 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:57:28,078 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:57:28,967 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:57:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:29,670 INFO L93 Difference]: Finished difference Result 14120 states and 36372 transitions. [2021-06-05 17:57:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 17:57:29,671 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:57:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:29,685 INFO L225 Difference]: With dead ends: 14120 [2021-06-05 17:57:29,685 INFO L226 Difference]: Without dead ends: 13700 [2021-06-05 17:57:29,687 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5183 ImplicationChecksByTransitivity, 16906.9ms TimeCoverageRelationStatistics Valid=1685, Invalid=17221, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 17:57:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13700 states. [2021-06-05 17:57:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13700 to 9681. [2021-06-05 17:57:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9681 states, 9679 states have (on average 2.5615249509246825) internal successors, (24793), 9680 states have internal predecessors, (24793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:57:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9681 states to 9681 states and 24793 transitions. [2021-06-05 17:57:29,805 INFO L78 Accepts]: Start accepts. Automaton has 9681 states and 24793 transitions. Word has length 184 [2021-06-05 17:57:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:29,805 INFO L482 AbstractCegarLoop]: Abstraction has 9681 states and 24793 transitions. [2021-06-05 17:57:29,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:57:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 9681 states and 24793 transitions. [2021-06-05 17:57:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:57:29,813 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:29,813 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:57:29,813 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 17:57:29,813 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:29,813 INFO L82 PathProgramCache]: Analyzing trace with hash 938788039, now seen corresponding path program 8 times [2021-06-05 17:57:29,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:29,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520095918] [2021-06-05 17:57:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:30,484 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:57:30,716 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 17:57:31,878 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:57:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:57:35,084 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:57:35,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520095918] [2021-06-05 17:57:35,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520095918] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:57:35,084 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:57:35,084 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:57:35,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092352827] [2021-06-05 17:57:35,084 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:57:35,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:57:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:57:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:57:35,085 INFO L87 Difference]: Start difference. First operand 9681 states and 24793 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:57:39,099 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 17:57:39,742 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 17:57:41,614 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 17:57:42,091 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 17:57:43,111 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2021-06-05 17:57:44,235 WARN L205 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2021-06-05 17:57:47,123 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:57:47,380 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:57:47,626 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 17:57:49,394 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:57:51,539 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:57:53,598 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:57:54,557 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:57:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:57:55,339 INFO L93 Difference]: Finished difference Result 14133 states and 36407 transitions. [2021-06-05 17:57:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 17:57:55,340 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:57:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:57:55,355 INFO L225 Difference]: With dead ends: 14133 [2021-06-05 17:57:55,356 INFO L226 Difference]: Without dead ends: 13713 [2021-06-05 17:57:55,358 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5468 ImplicationChecksByTransitivity, 17504.0ms TimeCoverageRelationStatistics Valid=1722, Invalid=18018, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 17:57:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13713 states. [2021-06-05 17:57:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13713 to 9694. [2021-06-05 17:57:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9694 states, 9692 states have (on average 2.561700371440363) internal successors, (24828), 9693 states have internal predecessors, (24828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:57:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9694 states to 9694 states and 24828 transitions. [2021-06-05 17:57:55,491 INFO L78 Accepts]: Start accepts. Automaton has 9694 states and 24828 transitions. Word has length 184 [2021-06-05 17:57:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:57:55,491 INFO L482 AbstractCegarLoop]: Abstraction has 9694 states and 24828 transitions. [2021-06-05 17:57:55,491 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:57:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9694 states and 24828 transitions. [2021-06-05 17:57:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:57:55,499 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:57:55,500 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:57:55,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 17:57:55,500 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:57:55,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:57:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1640877331, now seen corresponding path program 9 times [2021-06-05 17:57:55,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:57:55,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941221123] [2021-06-05 17:57:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:57:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:57:56,157 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:57:57,751 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:58:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:58:01,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:58:01,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941221123] [2021-06-05 17:58:01,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941221123] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:58:01,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:58:01,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:58:01,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051504520] [2021-06-05 17:58:01,279 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:58:01,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:58:01,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:58:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:58:01,279 INFO L87 Difference]: Start difference. First operand 9694 states and 24828 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:58:04,442 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 17:58:04,777 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 17:58:06,085 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 51 [2021-06-05 17:58:06,400 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 53 [2021-06-05 17:58:07,014 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 78 [2021-06-05 17:58:07,595 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 76 [2021-06-05 17:58:10,864 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:58:11,149 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:58:13,672 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:58:16,396 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:58:18,816 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:58:19,933 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:58:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:58:20,890 INFO L93 Difference]: Finished difference Result 15477 states and 39922 transitions. [2021-06-05 17:58:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 17:58:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:58:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:58:20,908 INFO L225 Difference]: With dead ends: 15477 [2021-06-05 17:58:20,908 INFO L226 Difference]: Without dead ends: 15057 [2021-06-05 17:58:20,910 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5470 ImplicationChecksByTransitivity, 16701.5ms TimeCoverageRelationStatistics Valid=1810, Invalid=17930, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 17:58:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15057 states. [2021-06-05 17:58:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15057 to 9798. [2021-06-05 17:58:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9798 states, 9796 states have (on average 2.5630869742752145) internal successors, (25108), 9797 states have internal predecessors, (25108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:58:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9798 states to 9798 states and 25108 transitions. [2021-06-05 17:58:21,049 INFO L78 Accepts]: Start accepts. Automaton has 9798 states and 25108 transitions. Word has length 184 [2021-06-05 17:58:21,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:58:21,049 INFO L482 AbstractCegarLoop]: Abstraction has 9798 states and 25108 transitions. [2021-06-05 17:58:21,049 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:58:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9798 states and 25108 transitions. [2021-06-05 17:58:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:58:21,057 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:58:21,058 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:58:21,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 17:58:21,058 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:58:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:58:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash -761059539, now seen corresponding path program 10 times [2021-06-05 17:58:21,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:58:21,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079832084] [2021-06-05 17:58:21,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:58:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:58:21,632 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 17:58:21,881 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:58:22,245 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 17:58:23,911 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:58:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:58:26,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:58:26,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079832084] [2021-06-05 17:58:26,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079832084] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:58:26,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:58:26,355 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:58:26,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802042829] [2021-06-05 17:58:26,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:58:26,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:58:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:58:26,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:58:26,357 INFO L87 Difference]: Start difference. First operand 9798 states and 25108 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:58:29,172 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 17:58:29,574 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 17:58:31,428 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 53 [2021-06-05 17:58:32,123 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2021-06-05 17:58:32,837 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2021-06-05 17:58:36,210 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:58:36,532 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:58:36,806 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 17:58:39,450 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:58:42,588 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:58:45,079 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-06-05 17:58:45,271 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:58:46,052 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:58:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:58:46,738 INFO L93 Difference]: Finished difference Result 15333 states and 39480 transitions. [2021-06-05 17:58:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 17:58:46,739 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:58:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:58:46,754 INFO L225 Difference]: With dead ends: 15333 [2021-06-05 17:58:46,754 INFO L226 Difference]: Without dead ends: 14913 [2021-06-05 17:58:46,755 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5541 ImplicationChecksByTransitivity, 16916.0ms TimeCoverageRelationStatistics Valid=1927, Invalid=17813, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 17:58:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14913 states. [2021-06-05 17:58:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14913 to 9811. [2021-06-05 17:58:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9811 states, 9809 states have (on average 2.563258232235702) internal successors, (25143), 9810 states have internal predecessors, (25143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:58:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 25143 transitions. [2021-06-05 17:58:46,874 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 25143 transitions. Word has length 184 [2021-06-05 17:58:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:58:46,874 INFO L482 AbstractCegarLoop]: Abstraction has 9811 states and 25143 transitions. [2021-06-05 17:58:46,874 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:58:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 25143 transitions. [2021-06-05 17:58:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:58:46,882 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:58:46,882 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:58:46,882 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 17:58:46,883 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:58:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:58:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1135479111, now seen corresponding path program 11 times [2021-06-05 17:58:46,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:58:46,883 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64795104] [2021-06-05 17:58:46,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:58:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:58:47,518 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:58:47,719 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 17:58:48,827 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:58:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:58:51,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:58:51,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64795104] [2021-06-05 17:58:51,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64795104] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:58:51,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:58:51,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:58:51,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254735228] [2021-06-05 17:58:51,443 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:58:51,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:58:51,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:58:51,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:58:51,444 INFO L87 Difference]: Start difference. First operand 9811 states and 25143 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:58:54,671 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 17:58:55,246 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 17:58:59,710 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:59:00,125 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:59:00,517 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 17:59:04,188 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:59:08,464 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:59:10,452 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:59:11,303 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:59:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:59:12,210 INFO L93 Difference]: Finished difference Result 15037 states and 38694 transitions. [2021-06-05 17:59:12,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 17:59:12,211 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:59:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:59:12,225 INFO L225 Difference]: With dead ends: 15037 [2021-06-05 17:59:12,225 INFO L226 Difference]: Without dead ends: 14617 [2021-06-05 17:59:12,227 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4664 ImplicationChecksByTransitivity, 14017.5ms TimeCoverageRelationStatistics Valid=1610, Invalid=15420, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 17:59:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14617 states. [2021-06-05 17:59:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14617 to 9850. [2021-06-05 17:59:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9850 states, 9848 states have (on average 2.563769293257514) internal successors, (25248), 9849 states have internal predecessors, (25248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:59:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9850 states to 9850 states and 25248 transitions. [2021-06-05 17:59:12,361 INFO L78 Accepts]: Start accepts. Automaton has 9850 states and 25248 transitions. Word has length 184 [2021-06-05 17:59:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:59:12,361 INFO L482 AbstractCegarLoop]: Abstraction has 9850 states and 25248 transitions. [2021-06-05 17:59:12,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:59:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 9850 states and 25248 transitions. [2021-06-05 17:59:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:59:12,369 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:59:12,370 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:59:12,370 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 17:59:12,370 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:59:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:59:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1066712083, now seen corresponding path program 12 times [2021-06-05 17:59:12,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:59:12,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458026667] [2021-06-05 17:59:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:59:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:59:12,963 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:59:14,299 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:59:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:59:17,320 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:59:17,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458026667] [2021-06-05 17:59:17,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458026667] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:59:17,320 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:59:17,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:59:17,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448638806] [2021-06-05 17:59:17,321 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:59:17,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:59:17,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:59:17,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:59:17,322 INFO L87 Difference]: Start difference. First operand 9850 states and 25248 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:59:21,246 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 17:59:21,858 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 17:59:26,387 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:59:26,780 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:59:27,148 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 17:59:27,556 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2021-06-05 17:59:30,187 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:59:32,401 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:59:34,220 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-06-05 17:59:34,435 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:59:35,294 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:59:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:59:36,198 INFO L93 Difference]: Finished difference Result 14573 states and 37510 transitions. [2021-06-05 17:59:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 17:59:36,199 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:59:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:59:36,214 INFO L225 Difference]: With dead ends: 14573 [2021-06-05 17:59:36,214 INFO L226 Difference]: Without dead ends: 14153 [2021-06-05 17:59:36,215 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4564 ImplicationChecksByTransitivity, 14586.4ms TimeCoverageRelationStatistics Valid=1590, Invalid=15180, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 17:59:36,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14153 states. [2021-06-05 17:59:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14153 to 9863. [2021-06-05 17:59:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9863 states, 9861 states have (on average 2.563938748605618) internal successors, (25283), 9862 states have internal predecessors, (25283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:59:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 25283 transitions. [2021-06-05 17:59:36,346 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 25283 transitions. Word has length 184 [2021-06-05 17:59:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:59:36,346 INFO L482 AbstractCegarLoop]: Abstraction has 9863 states and 25283 transitions. [2021-06-05 17:59:36,346 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:59:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 25283 transitions. [2021-06-05 17:59:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:59:36,354 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:59:36,354 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:59:36,354 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 17:59:36,354 INFO L430 AbstractCegarLoop]: === Iteration 25 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:59:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:59:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1230698425, now seen corresponding path program 13 times [2021-06-05 17:59:36,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:59:36,355 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920994751] [2021-06-05 17:59:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:59:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:59:36,992 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 17:59:37,179 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 17:59:38,407 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 17:59:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 17:59:41,567 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 17:59:41,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920994751] [2021-06-05 17:59:41,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920994751] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 17:59:41,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 17:59:41,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 17:59:41,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6667492] [2021-06-05 17:59:41,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 17:59:41,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 17:59:41,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 17:59:41,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 17:59:41,569 INFO L87 Difference]: Start difference. First operand 9863 states and 25283 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:59:45,522 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 17:59:46,125 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 17:59:49,724 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 17:59:50,709 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 17:59:50,967 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 17:59:51,169 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 17:59:52,872 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 17:59:55,162 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 17:59:57,239 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 17:59:58,136 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 17:59:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 17:59:59,019 INFO L93 Difference]: Finished difference Result 14101 states and 36308 transitions. [2021-06-05 17:59:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 17:59:59,019 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 17:59:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 17:59:59,034 INFO L225 Difference]: With dead ends: 14101 [2021-06-05 17:59:59,034 INFO L226 Difference]: Without dead ends: 13681 [2021-06-05 17:59:59,035 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4394 ImplicationChecksByTransitivity, 14481.9ms TimeCoverageRelationStatistics Valid=1538, Invalid=14718, Unknown=0, NotChecked=0, Total=16256 [2021-06-05 17:59:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13681 states. [2021-06-05 17:59:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13681 to 9876. [2021-06-05 17:59:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9876 states, 9874 states have (on average 2.56410775774762) internal successors, (25318), 9875 states have internal predecessors, (25318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:59:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9876 states to 9876 states and 25318 transitions. [2021-06-05 17:59:59,156 INFO L78 Accepts]: Start accepts. Automaton has 9876 states and 25318 transitions. Word has length 184 [2021-06-05 17:59:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 17:59:59,156 INFO L482 AbstractCegarLoop]: Abstraction has 9876 states and 25318 transitions. [2021-06-05 17:59:59,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 17:59:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9876 states and 25318 transitions. [2021-06-05 17:59:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 17:59:59,165 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 17:59:59,165 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 17:59:59,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 17:59:59,165 INFO L430 AbstractCegarLoop]: === Iteration 26 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 17:59:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 17:59:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1256034409, now seen corresponding path program 14 times [2021-06-05 17:59:59,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 17:59:59,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137197511] [2021-06-05 17:59:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 17:59:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 17:59:59,833 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:00:01,595 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:00:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:00:05,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:00:05,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137197511] [2021-06-05 18:00:05,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137197511] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:00:05,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:00:05,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:00:05,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115809442] [2021-06-05 18:00:05,308 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:00:05,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:00:05,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:00:05,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:00:05,309 INFO L87 Difference]: Start difference. First operand 9876 states and 25318 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:00:10,327 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:00:10,982 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 18:00:13,968 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:00:14,248 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:00:15,121 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2021-06-05 18:00:15,333 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 18:00:16,469 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-06-05 18:00:17,539 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:00:20,258 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:00:22,612 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:00:23,642 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:00:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:00:24,972 INFO L93 Difference]: Finished difference Result 14542 states and 37480 transitions. [2021-06-05 18:00:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 18:00:24,972 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:00:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:00:24,989 INFO L225 Difference]: With dead ends: 14542 [2021-06-05 18:00:24,989 INFO L226 Difference]: Without dead ends: 14122 [2021-06-05 18:00:24,991 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4737 ImplicationChecksByTransitivity, 16651.0ms TimeCoverageRelationStatistics Valid=1625, Invalid=15667, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 18:00:25,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14122 states. [2021-06-05 18:00:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14122 to 9889. [2021-06-05 18:00:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9889 states, 9887 states have (on average 2.5655911803378175) internal successors, (25366), 9888 states have internal predecessors, (25366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:00:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9889 states to 9889 states and 25366 transitions. [2021-06-05 18:00:25,130 INFO L78 Accepts]: Start accepts. Automaton has 9889 states and 25366 transitions. Word has length 184 [2021-06-05 18:00:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:00:25,130 INFO L482 AbstractCegarLoop]: Abstraction has 9889 states and 25366 transitions. [2021-06-05 18:00:25,131 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:00:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 9889 states and 25366 transitions. [2021-06-05 18:00:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:00:25,139 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:00:25,139 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:00:25,139 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 18:00:25,139 INFO L430 AbstractCegarLoop]: === Iteration 27 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:00:25,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:00:25,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1126659863, now seen corresponding path program 15 times [2021-06-05 18:00:25,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:00:25,140 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516333925] [2021-06-05 18:00:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:00:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:00:25,902 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:00:26,109 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 18:00:27,841 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:00:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:00:31,974 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:00:31,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516333925] [2021-06-05 18:00:31,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516333925] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:00:31,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:00:31,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:00:31,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028684707] [2021-06-05 18:00:31,975 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:00:31,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:00:31,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:00:31,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:00:31,976 INFO L87 Difference]: Start difference. First operand 9889 states and 25366 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:00:35,028 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2021-06-05 18:00:36,276 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:00:36,594 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 18:00:39,026 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:00:39,319 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:00:40,731 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 18:00:42,920 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:00:45,783 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:00:48,621 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:00:49,781 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:00:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:00:51,408 INFO L93 Difference]: Finished difference Result 15042 states and 38753 transitions. [2021-06-05 18:00:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 18:00:51,408 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:00:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:00:51,424 INFO L225 Difference]: With dead ends: 15042 [2021-06-05 18:00:51,424 INFO L226 Difference]: Without dead ends: 14622 [2021-06-05 18:00:51,426 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4638 ImplicationChecksByTransitivity, 16433.8ms TimeCoverageRelationStatistics Valid=1609, Invalid=15421, Unknown=0, NotChecked=0, Total=17030 [2021-06-05 18:00:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14622 states. [2021-06-05 18:00:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14622 to 10006. [2021-06-05 18:00:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10006 states, 10004 states have (on average 2.567073170731707) internal successors, (25681), 10005 states have internal predecessors, (25681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:00:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10006 states to 10006 states and 25681 transitions. [2021-06-05 18:00:51,553 INFO L78 Accepts]: Start accepts. Automaton has 10006 states and 25681 transitions. Word has length 184 [2021-06-05 18:00:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:00:51,553 INFO L482 AbstractCegarLoop]: Abstraction has 10006 states and 25681 transitions. [2021-06-05 18:00:51,553 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:00:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 10006 states and 25681 transitions. [2021-06-05 18:00:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:00:51,561 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:00:51,562 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:00:51,562 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 18:00:51,562 INFO L430 AbstractCegarLoop]: === Iteration 28 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:00:51,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:00:51,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1048916267, now seen corresponding path program 16 times [2021-06-05 18:00:51,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:00:51,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899853619] [2021-06-05 18:00:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:00:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:00:52,350 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:00:52,740 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 18:00:53,791 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-06-05 18:00:55,111 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:00:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:00:59,764 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:00:59,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899853619] [2021-06-05 18:00:59,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899853619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:00:59,764 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:00:59,764 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:00:59,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820389207] [2021-06-05 18:00:59,765 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:00:59,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:00:59,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:00:59,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:00:59,765 INFO L87 Difference]: Start difference. First operand 10006 states and 25681 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:01:02,084 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:01:02,411 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 18:01:04,842 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:01:05,155 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:01:06,601 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 18:01:09,195 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:01:12,324 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:01:15,081 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:01:16,393 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:01:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:01:17,756 INFO L93 Difference]: Finished difference Result 16996 states and 43767 transitions. [2021-06-05 18:01:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-05 18:01:17,756 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:01:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:01:17,775 INFO L225 Difference]: With dead ends: 16996 [2021-06-05 18:01:17,775 INFO L226 Difference]: Without dead ends: 16576 [2021-06-05 18:01:17,777 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4821 ImplicationChecksByTransitivity, 17084.3ms TimeCoverageRelationStatistics Valid=1646, Invalid=15910, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 18:01:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16576 states. [2021-06-05 18:01:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16576 to 10110. [2021-06-05 18:01:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10110 states, 10108 states have (on average 2.569647803719826) internal successors, (25974), 10109 states have internal predecessors, (25974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:01:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10110 states to 10110 states and 25974 transitions. [2021-06-05 18:01:17,916 INFO L78 Accepts]: Start accepts. Automaton has 10110 states and 25974 transitions. Word has length 184 [2021-06-05 18:01:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:01:17,916 INFO L482 AbstractCegarLoop]: Abstraction has 10110 states and 25974 transitions. [2021-06-05 18:01:17,916 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:01:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10110 states and 25974 transitions. [2021-06-05 18:01:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:01:17,924 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:01:17,925 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:01:17,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 18:01:17,925 INFO L430 AbstractCegarLoop]: === Iteration 29 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:01:17,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:01:17,925 INFO L82 PathProgramCache]: Analyzing trace with hash 734173673, now seen corresponding path program 17 times [2021-06-05 18:01:17,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:01:17,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216444983] [2021-06-05 18:01:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:01:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:01:18,637 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:01:18,862 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-06-05 18:01:21,237 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:01:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:01:23,519 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:01:23,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216444983] [2021-06-05 18:01:23,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216444983] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:01:23,519 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:01:23,519 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:01:23,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337889929] [2021-06-05 18:01:23,519 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:01:23,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:01:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:01:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:01:23,520 INFO L87 Difference]: Start difference. First operand 10110 states and 25974 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:01:26,105 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:01:26,490 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 18:01:29,328 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:01:29,655 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:01:34,774 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:01:37,683 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 18:01:38,110 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:01:41,229 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:01:42,544 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:01:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:01:44,020 INFO L93 Difference]: Finished difference Result 16908 states and 43553 transitions. [2021-06-05 18:01:44,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-06-05 18:01:44,021 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:01:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:01:44,112 INFO L225 Difference]: With dead ends: 16908 [2021-06-05 18:01:44,113 INFO L226 Difference]: Without dead ends: 16488 [2021-06-05 18:01:44,113 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4898 ImplicationChecksByTransitivity, 15474.3ms TimeCoverageRelationStatistics Valid=1660, Invalid=16162, Unknown=0, NotChecked=0, Total=17822 [2021-06-05 18:01:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16488 states. [2021-06-05 18:01:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16488 to 10149. [2021-06-05 18:01:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10149 states, 10147 states have (on average 2.570119247068099) internal successors, (26079), 10148 states have internal predecessors, (26079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:01:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10149 states to 10149 states and 26079 transitions. [2021-06-05 18:01:44,238 INFO L78 Accepts]: Start accepts. Automaton has 10149 states and 26079 transitions. Word has length 184 [2021-06-05 18:01:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:01:44,238 INFO L482 AbstractCegarLoop]: Abstraction has 10149 states and 26079 transitions. [2021-06-05 18:01:44,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:01:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 10149 states and 26079 transitions. [2021-06-05 18:01:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:01:44,246 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:01:44,246 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:01:44,246 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 18:01:44,246 INFO L430 AbstractCegarLoop]: === Iteration 30 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:01:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:01:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1053236985, now seen corresponding path program 18 times [2021-06-05 18:01:44,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:01:44,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139749988] [2021-06-05 18:01:44,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:01:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:01:44,839 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:01:46,065 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:01:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:01:48,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:01:48,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139749988] [2021-06-05 18:01:48,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139749988] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:01:48,486 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:01:48,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:01:48,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718627533] [2021-06-05 18:01:48,486 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:01:48,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:01:48,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:01:48,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:01:48,487 INFO L87 Difference]: Start difference. First operand 10149 states and 26079 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:01:51,349 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:01:51,826 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 18:01:54,846 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:01:55,178 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:01:57,045 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 18:02:01,484 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:02:05,293 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:02:07,975 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:02:08,831 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:02:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:02:09,476 INFO L93 Difference]: Finished difference Result 16868 states and 43463 transitions. [2021-06-05 18:02:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-05 18:02:09,476 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:02:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:02:09,491 INFO L225 Difference]: With dead ends: 16868 [2021-06-05 18:02:09,491 INFO L226 Difference]: Without dead ends: 16448 [2021-06-05 18:02:09,492 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4990 ImplicationChecksByTransitivity, 14261.8ms TimeCoverageRelationStatistics Valid=1677, Invalid=16413, Unknown=0, NotChecked=0, Total=18090 [2021-06-05 18:02:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16448 states. [2021-06-05 18:02:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16448 to 10175. [2021-06-05 18:02:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10175 states, 10173 states have (on average 2.5704315344539466) internal successors, (26149), 10174 states have internal predecessors, (26149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:02:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 26149 transitions. [2021-06-05 18:02:09,619 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 26149 transitions. Word has length 184 [2021-06-05 18:02:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:02:09,619 INFO L482 AbstractCegarLoop]: Abstraction has 10175 states and 26149 transitions. [2021-06-05 18:02:09,619 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:02:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 26149 transitions. [2021-06-05 18:02:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:02:09,627 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:02:09,627 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:02:09,627 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 18:02:09,627 INFO L430 AbstractCegarLoop]: === Iteration 31 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:02:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:02:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -591523705, now seen corresponding path program 19 times [2021-06-05 18:02:09,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:02:09,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393026882] [2021-06-05 18:02:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:02:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:02:10,215 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:02:11,423 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:02:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:02:14,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:02:14,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393026882] [2021-06-05 18:02:14,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393026882] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:02:14,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:02:14,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:02:14,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832895745] [2021-06-05 18:02:14,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:02:14,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:02:14,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:02:14,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2568, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:02:14,019 INFO L87 Difference]: Start difference. First operand 10175 states and 26149 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:02:17,304 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2021-06-05 18:02:17,831 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2021-06-05 18:02:21,580 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2021-06-05 18:02:31,235 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-05 18:02:31,623 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-06-05 18:02:32,605 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2021-06-05 18:02:33,519 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2021-06-05 18:02:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:02:35,615 INFO L93 Difference]: Finished difference Result 16890 states and 43523 transitions. [2021-06-05 18:02:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:02:35,615 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:02:35,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:02:35,632 INFO L225 Difference]: With dead ends: 16890 [2021-06-05 18:02:35,632 INFO L226 Difference]: Without dead ends: 16470 [2021-06-05 18:02:35,633 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5185 ImplicationChecksByTransitivity, 14170.4ms TimeCoverageRelationStatistics Valid=1709, Invalid=17197, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:02:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16470 states. [2021-06-05 18:02:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16470 to 10188. [2021-06-05 18:02:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10188 states, 10186 states have (on average 2.5705870803063027) internal successors, (26184), 10187 states have internal predecessors, (26184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:02:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10188 states to 10188 states and 26184 transitions. [2021-06-05 18:02:35,769 INFO L78 Accepts]: Start accepts. Automaton has 10188 states and 26184 transitions. Word has length 184 [2021-06-05 18:02:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:02:35,769 INFO L482 AbstractCegarLoop]: Abstraction has 10188 states and 26184 transitions. [2021-06-05 18:02:35,769 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:02:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 10188 states and 26184 transitions. [2021-06-05 18:02:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:02:35,777 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:02:35,777 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:02:35,777 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 18:02:35,777 INFO L430 AbstractCegarLoop]: === Iteration 32 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:02:35,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:02:35,777 INFO L82 PathProgramCache]: Analyzing trace with hash -635223827, now seen corresponding path program 20 times [2021-06-05 18:02:35,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:02:35,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836590464] [2021-06-05 18:02:35,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:02:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:02:36,356 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:02:37,989 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-06-05 18:02:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:02:41,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:02:41,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836590464] [2021-06-05 18:02:41,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836590464] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:02:41,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:02:41,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-06-05 18:02:41,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204010692] [2021-06-05 18:02:41,404 INFO L462 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-06-05 18:02:41,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:02:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-06-05 18:02:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 18:02:41,404 INFO L87 Difference]: Start difference. First operand 10188 states and 26184 transitions. Second operand has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:02:45,250 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2021-06-05 18:02:45,926 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 18:02:49,338 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 18:02:49,778 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 18:02:52,511 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2021-06-05 18:02:53,969 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2021-06-05 18:02:56,057 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:02:58,028 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-06-05 18:02:58,931 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 18:02:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:02:59,607 INFO L93 Difference]: Finished difference Result 18020 states and 46463 transitions. [2021-06-05 18:02:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 18:02:59,607 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:02:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:02:59,626 INFO L225 Difference]: With dead ends: 18020 [2021-06-05 18:02:59,627 INFO L226 Difference]: Without dead ends: 17600 [2021-06-05 18:02:59,628 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5254 ImplicationChecksByTransitivity, 16250.2ms TimeCoverageRelationStatistics Valid=1737, Invalid=17169, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 18:02:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17600 states. [2021-06-05 18:02:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17600 to 10500. [2021-06-05 18:02:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10500 states, 10498 states have (on average 2.5742046104019813) internal successors, (27024), 10499 states have internal predecessors, (27024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:02:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 27024 transitions. [2021-06-05 18:02:59,786 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 27024 transitions. Word has length 184 [2021-06-05 18:02:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:02:59,786 INFO L482 AbstractCegarLoop]: Abstraction has 10500 states and 27024 transitions. [2021-06-05 18:02:59,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 3.4716981132075473) internal successors, (184), 53 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:02:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 27024 transitions. [2021-06-05 18:02:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:02:59,795 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:02:59,795 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:02:59,795 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 18:02:59,796 INFO L430 AbstractCegarLoop]: === Iteration 33 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:02:59,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:02:59,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1512948955, now seen corresponding path program 21 times [2021-06-05 18:02:59,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:02:59,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194185359] [2021-06-05 18:02:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:02:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:03:00,445 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:03:00,632 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 18:03:00,799 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 18:03:01,450 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 18:03:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:03:03,691 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:03:03,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194185359] [2021-06-05 18:03:03,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194185359] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:03:03,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:03:03,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 18:03:03,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013008207] [2021-06-05 18:03:03,692 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 18:03:03,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:03:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 18:03:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:03:03,693 INFO L87 Difference]: Start difference. First operand 10500 states and 27024 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:07,513 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 18:03:08,112 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 18:03:11,947 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 18:03:13,737 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 18:03:15,029 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 18:03:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:03:16,281 INFO L93 Difference]: Finished difference Result 16319 states and 42074 transitions. [2021-06-05 18:03:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-06-05 18:03:16,282 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:03:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:03:16,299 INFO L225 Difference]: With dead ends: 16319 [2021-06-05 18:03:16,300 INFO L226 Difference]: Without dead ends: 15899 [2021-06-05 18:03:16,301 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3413 ImplicationChecksByTransitivity, 10815.8ms TimeCoverageRelationStatistics Valid=1154, Invalid=11056, Unknown=0, NotChecked=0, Total=12210 [2021-06-05 18:03:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15899 states. [2021-06-05 18:03:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15899 to 10952. [2021-06-05 18:03:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10952 states, 10950 states have (on average 2.5774429223744293) internal successors, (28223), 10951 states have internal predecessors, (28223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10952 states to 10952 states and 28223 transitions. [2021-06-05 18:03:16,444 INFO L78 Accepts]: Start accepts. Automaton has 10952 states and 28223 transitions. Word has length 184 [2021-06-05 18:03:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:03:16,445 INFO L482 AbstractCegarLoop]: Abstraction has 10952 states and 28223 transitions. [2021-06-05 18:03:16,445 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10952 states and 28223 transitions. [2021-06-05 18:03:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:03:16,453 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:03:16,453 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:03:16,454 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 18:03:16,454 INFO L430 AbstractCegarLoop]: === Iteration 34 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:03:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:03:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1843364471, now seen corresponding path program 22 times [2021-06-05 18:03:16,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:03:16,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410239005] [2021-06-05 18:03:16,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:03:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:03:17,041 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:03:17,218 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 18:03:17,392 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 18:03:18,253 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 18:03:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:03:21,045 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:03:21,045 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410239005] [2021-06-05 18:03:21,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410239005] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:03:21,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:03:21,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 18:03:21,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27786577] [2021-06-05 18:03:21,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 18:03:21,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:03:21,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 18:03:21,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:03:21,046 INFO L87 Difference]: Start difference. First operand 10952 states and 28223 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:24,852 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 18:03:25,452 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 18:03:30,337 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 18:03:32,050 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 18:03:33,290 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 18:03:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:03:34,368 INFO L93 Difference]: Finished difference Result 16869 states and 43528 transitions. [2021-06-05 18:03:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-06-05 18:03:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:03:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:03:34,387 INFO L225 Difference]: With dead ends: 16869 [2021-06-05 18:03:34,387 INFO L226 Difference]: Without dead ends: 16449 [2021-06-05 18:03:34,388 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3562 ImplicationChecksByTransitivity, 11809.1ms TimeCoverageRelationStatistics Valid=1181, Invalid=11475, Unknown=0, NotChecked=0, Total=12656 [2021-06-05 18:03:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16449 states. [2021-06-05 18:03:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 11056. [2021-06-05 18:03:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11056 states, 11054 states have (on average 2.579699656233038) internal successors, (28516), 11055 states have internal predecessors, (28516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11056 states to 11056 states and 28516 transitions. [2021-06-05 18:03:34,538 INFO L78 Accepts]: Start accepts. Automaton has 11056 states and 28516 transitions. Word has length 184 [2021-06-05 18:03:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:03:34,538 INFO L482 AbstractCegarLoop]: Abstraction has 11056 states and 28516 transitions. [2021-06-05 18:03:34,538 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 11056 states and 28516 transitions. [2021-06-05 18:03:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:03:34,548 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:03:34,548 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:03:34,548 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 18:03:34,549 INFO L430 AbstractCegarLoop]: === Iteration 35 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:03:34,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:03:34,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2136860231, now seen corresponding path program 23 times [2021-06-05 18:03:34,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:03:34,549 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491866135] [2021-06-05 18:03:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:03:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:03:35,209 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:03:35,399 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 18:03:35,582 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 18:03:36,255 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 18:03:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:03:38,861 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:03:38,861 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491866135] [2021-06-05 18:03:38,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491866135] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:03:38,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:03:38,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 18:03:38,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596804542] [2021-06-05 18:03:38,861 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 18:03:38,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:03:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 18:03:38,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:03:38,862 INFO L87 Difference]: Start difference. First operand 11056 states and 28516 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:41,807 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 18:03:42,372 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 18:03:47,464 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 18:03:49,110 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 18:03:50,304 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 18:03:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:03:51,242 INFO L93 Difference]: Finished difference Result 16757 states and 43260 transitions. [2021-06-05 18:03:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-06-05 18:03:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:03:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:03:51,260 INFO L225 Difference]: With dead ends: 16757 [2021-06-05 18:03:51,260 INFO L226 Difference]: Without dead ends: 16337 [2021-06-05 18:03:51,261 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3636 ImplicationChecksByTransitivity, 11136.4ms TimeCoverageRelationStatistics Valid=1191, Invalid=11691, Unknown=0, NotChecked=0, Total=12882 [2021-06-05 18:03:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16337 states. [2021-06-05 18:03:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16337 to 11095. [2021-06-05 18:03:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11095 states, 11093 states have (on average 2.5800955557558822) internal successors, (28621), 11094 states have internal predecessors, (28621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11095 states to 11095 states and 28621 transitions. [2021-06-05 18:03:51,409 INFO L78 Accepts]: Start accepts. Automaton has 11095 states and 28621 transitions. Word has length 184 [2021-06-05 18:03:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:03:51,409 INFO L482 AbstractCegarLoop]: Abstraction has 11095 states and 28621 transitions. [2021-06-05 18:03:51,409 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 11095 states and 28621 transitions. [2021-06-05 18:03:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:03:51,418 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:03:51,418 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:03:51,418 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 18:03:51,419 INFO L430 AbstractCegarLoop]: === Iteration 36 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:03:51,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:03:51,419 INFO L82 PathProgramCache]: Analyzing trace with hash 349449573, now seen corresponding path program 24 times [2021-06-05 18:03:51,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:03:51,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522635725] [2021-06-05 18:03:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:03:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:03:52,004 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:03:52,146 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 18:03:52,306 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 18:03:52,907 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 18:03:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:03:54,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:03:54,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522635725] [2021-06-05 18:03:54,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522635725] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:03:54,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:03:54,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 18:03:54,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744136605] [2021-06-05 18:03:54,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 18:03:54,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:03:54,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 18:03:54,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:03:54,942 INFO L87 Difference]: Start difference. First operand 11095 states and 28621 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:03:57,680 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 18:03:58,190 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 18:04:04,122 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 18:04:05,884 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 18:04:07,115 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 18:04:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:04:08,188 INFO L93 Difference]: Finished difference Result 16701 states and 43134 transitions. [2021-06-05 18:04:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-06-05 18:04:08,188 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:04:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:04:08,205 INFO L225 Difference]: With dead ends: 16701 [2021-06-05 18:04:08,205 INFO L226 Difference]: Without dead ends: 16281 [2021-06-05 18:04:08,206 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3705 ImplicationChecksByTransitivity, 10241.0ms TimeCoverageRelationStatistics Valid=1204, Invalid=11906, Unknown=0, NotChecked=0, Total=13110 [2021-06-05 18:04:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16281 states. [2021-06-05 18:04:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16281 to 11121. [2021-06-05 18:04:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11121 states, 11119 states have (on average 2.5803579458584407) internal successors, (28691), 11120 states have internal predecessors, (28691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11121 states to 11121 states and 28691 transitions. [2021-06-05 18:04:08,350 INFO L78 Accepts]: Start accepts. Automaton has 11121 states and 28691 transitions. Word has length 184 [2021-06-05 18:04:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:04:08,351 INFO L482 AbstractCegarLoop]: Abstraction has 11121 states and 28691 transitions. [2021-06-05 18:04:08,351 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 11121 states and 28691 transitions. [2021-06-05 18:04:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:04:08,359 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:04:08,360 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:04:08,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 18:04:08,360 INFO L430 AbstractCegarLoop]: === Iteration 37 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:04:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:04:08,360 INFO L82 PathProgramCache]: Analyzing trace with hash 811162853, now seen corresponding path program 25 times [2021-06-05 18:04:08,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:04:08,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421278229] [2021-06-05 18:04:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:04:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:04:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:04:10,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:04:10,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421278229] [2021-06-05 18:04:10,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421278229] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:04:10,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:04:10,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-06-05 18:04:10,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929552204] [2021-06-05 18:04:10,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-06-05 18:04:10,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:04:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-06-05 18:04:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2031, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 18:04:10,377 INFO L87 Difference]: Start difference. First operand 11121 states and 28691 transitions. Second operand has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:12,730 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-05 18:04:14,166 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-06-05 18:04:14,385 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-06-05 18:04:14,898 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2021-06-05 18:04:15,104 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2021-06-05 18:04:15,345 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2021-06-05 18:04:15,952 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2021-06-05 18:04:16,236 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2021-06-05 18:04:16,512 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 87 [2021-06-05 18:04:17,757 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2021-06-05 18:04:18,160 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2021-06-05 18:04:18,346 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2021-06-05 18:04:18,678 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-06-05 18:04:18,821 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2021-06-05 18:04:18,969 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-06-05 18:04:19,134 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2021-06-05 18:04:19,301 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2021-06-05 18:04:19,455 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2021-06-05 18:04:19,602 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2021-06-05 18:04:19,762 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2021-06-05 18:04:19,937 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 18:04:20,247 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2021-06-05 18:04:20,456 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2021-06-05 18:04:20,610 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-06-05 18:04:20,852 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2021-06-05 18:04:21,042 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2021-06-05 18:04:21,206 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:04:21,473 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2021-06-05 18:04:21,777 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2021-06-05 18:04:22,046 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-06-05 18:04:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:04:22,563 INFO L93 Difference]: Finished difference Result 17352 states and 44853 transitions. [2021-06-05 18:04:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-05 18:04:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:04:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:04:22,583 INFO L225 Difference]: With dead ends: 17352 [2021-06-05 18:04:22,583 INFO L226 Difference]: Without dead ends: 16932 [2021-06-05 18:04:22,584 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4743 ImplicationChecksByTransitivity, 10937.4ms TimeCoverageRelationStatistics Valid=2019, Invalid=14751, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 18:04:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16932 states. [2021-06-05 18:04:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16932 to 11030. [2021-06-05 18:04:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11030 states, 11028 states have (on average 2.5794341675734493) internal successors, (28446), 11029 states have internal predecessors, (28446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11030 states to 11030 states and 28446 transitions. [2021-06-05 18:04:22,724 INFO L78 Accepts]: Start accepts. Automaton has 11030 states and 28446 transitions. Word has length 184 [2021-06-05 18:04:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:04:22,724 INFO L482 AbstractCegarLoop]: Abstraction has 11030 states and 28446 transitions. [2021-06-05 18:04:22,724 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 11030 states and 28446 transitions. [2021-06-05 18:04:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:04:22,732 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:04:22,733 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:04:22,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 18:04:22,733 INFO L430 AbstractCegarLoop]: === Iteration 38 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:04:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:04:22,733 INFO L82 PathProgramCache]: Analyzing trace with hash 767462731, now seen corresponding path program 26 times [2021-06-05 18:04:22,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:04:22,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108608217] [2021-06-05 18:04:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:04:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:04:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:04:24,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:04:24,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108608217] [2021-06-05 18:04:24,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108608217] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:04:24,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:04:24,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-06-05 18:04:24,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300616530] [2021-06-05 18:04:24,674 INFO L462 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-06-05 18:04:24,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:04:24,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-06-05 18:04:24,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2030, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 18:04:24,675 INFO L87 Difference]: Start difference. First operand 11030 states and 28446 transitions. Second operand has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:27,356 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-05 18:04:29,041 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-06-05 18:04:29,294 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-06-05 18:04:29,867 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2021-06-05 18:04:30,093 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2021-06-05 18:04:30,353 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2021-06-05 18:04:31,170 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2021-06-05 18:04:31,519 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2021-06-05 18:04:31,824 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 87 [2021-06-05 18:04:33,153 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2021-06-05 18:04:33,608 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2021-06-05 18:04:33,813 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2021-06-05 18:04:34,167 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-06-05 18:04:34,320 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2021-06-05 18:04:34,476 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2021-06-05 18:04:34,644 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2021-06-05 18:04:34,823 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2021-06-05 18:04:34,982 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2021-06-05 18:04:35,131 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2021-06-05 18:04:35,303 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2021-06-05 18:04:35,489 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 18:04:35,807 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2021-06-05 18:04:36,045 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2021-06-05 18:04:36,199 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-06-05 18:04:36,491 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2021-06-05 18:04:36,696 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2021-06-05 18:04:36,878 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 18:04:37,165 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2021-06-05 18:04:37,484 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2021-06-05 18:04:37,768 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-06-05 18:04:38,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:04:38,425 INFO L93 Difference]: Finished difference Result 17677 states and 45692 transitions. [2021-06-05 18:04:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-05 18:04:38,426 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:04:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:04:38,444 INFO L225 Difference]: With dead ends: 17677 [2021-06-05 18:04:38,444 INFO L226 Difference]: Without dead ends: 17257 [2021-06-05 18:04:38,445 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4737 ImplicationChecksByTransitivity, 10884.6ms TimeCoverageRelationStatistics Valid=2046, Invalid=14724, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 18:04:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17257 states. [2021-06-05 18:04:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17257 to 10640. [2021-06-05 18:04:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10640 states, 10638 states have (on average 2.572852039857116) internal successors, (27370), 10639 states have internal predecessors, (27370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10640 states to 10640 states and 27370 transitions. [2021-06-05 18:04:38,591 INFO L78 Accepts]: Start accepts. Automaton has 10640 states and 27370 transitions. Word has length 184 [2021-06-05 18:04:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:04:38,592 INFO L482 AbstractCegarLoop]: Abstraction has 10640 states and 27370 transitions. [2021-06-05 18:04:38,592 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 3.9148936170212765) internal successors, (184), 47 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 10640 states and 27370 transitions. [2021-06-05 18:04:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:04:38,600 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:04:38,600 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:04:38,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 18:04:38,600 INFO L430 AbstractCegarLoop]: === Iteration 39 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:04:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:04:38,600 INFO L82 PathProgramCache]: Analyzing trace with hash -98379989, now seen corresponding path program 27 times [2021-06-05 18:04:38,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:04:38,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672115856] [2021-06-05 18:04:38,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:04:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:04:39,150 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:04:39,335 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 18:04:39,486 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 18:04:40,069 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 18:04:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:04:42,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:04:42,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672115856] [2021-06-05 18:04:42,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672115856] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:04:42,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:04:42,058 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 18:04:42,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875268426] [2021-06-05 18:04:42,059 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 18:04:42,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:04:42,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 18:04:42,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:04:42,060 INFO L87 Difference]: Start difference. First operand 10640 states and 27370 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:44,561 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 18:04:44,959 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 18:04:48,602 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 18:04:50,493 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 18:04:51,787 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 18:04:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:04:53,033 INFO L93 Difference]: Finished difference Result 16857 states and 43405 transitions. [2021-06-05 18:04:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-05 18:04:53,034 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:04:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:04:53,051 INFO L225 Difference]: With dead ends: 16857 [2021-06-05 18:04:53,051 INFO L226 Difference]: Without dead ends: 16437 [2021-06-05 18:04:53,052 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 14 SyntacticMatches, 12 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3374 ImplicationChecksByTransitivity, 9058.1ms TimeCoverageRelationStatistics Valid=1130, Invalid=10860, Unknown=0, NotChecked=0, Total=11990 [2021-06-05 18:04:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16437 states. [2021-06-05 18:04:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16437 to 10704. [2021-06-05 18:04:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10704 states, 10702 states have (on average 2.570921323117174) internal successors, (27514), 10703 states have internal predecessors, (27514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10704 states to 10704 states and 27514 transitions. [2021-06-05 18:04:53,189 INFO L78 Accepts]: Start accepts. Automaton has 10704 states and 27514 transitions. Word has length 184 [2021-06-05 18:04:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:04:53,190 INFO L482 AbstractCegarLoop]: Abstraction has 10704 states and 27514 transitions. [2021-06-05 18:04:53,190 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:04:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 10704 states and 27514 transitions. [2021-06-05 18:04:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:04:53,198 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:04:53,198 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:04:53,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 18:04:53,198 INFO L430 AbstractCegarLoop]: === Iteration 40 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:04:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:04:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1534303503, now seen corresponding path program 28 times [2021-06-05 18:04:53,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:04:53,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648379739] [2021-06-05 18:04:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:04:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:04:53,794 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:04:53,996 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 18:04:54,169 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 18:04:54,858 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 18:04:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:04:57,392 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:04:57,392 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648379739] [2021-06-05 18:04:57,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648379739] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:04:57,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:04:57,392 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 18:04:57,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418335790] [2021-06-05 18:04:57,392 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 18:04:57,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:04:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 18:04:57,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:04:57,393 INFO L87 Difference]: Start difference. First operand 10704 states and 27514 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:01,052 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 18:05:01,651 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 18:05:07,096 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 18:05:09,016 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 18:05:10,315 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 18:05:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:05:11,667 INFO L93 Difference]: Finished difference Result 15305 states and 39327 transitions. [2021-06-05 18:05:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-06-05 18:05:11,668 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:05:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:05:11,683 INFO L225 Difference]: With dead ends: 15305 [2021-06-05 18:05:11,684 INFO L226 Difference]: Without dead ends: 14885 [2021-06-05 18:05:11,684 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3528 ImplicationChecksByTransitivity, 11219.9ms TimeCoverageRelationStatistics Valid=1151, Invalid=11281, Unknown=0, NotChecked=0, Total=12432 [2021-06-05 18:05:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14885 states. [2021-06-05 18:05:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14885 to 10699. [2021-06-05 18:05:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10699 states, 10697 states have (on average 2.5705337945218285) internal successors, (27497), 10698 states have internal predecessors, (27497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 27497 transitions. [2021-06-05 18:05:11,817 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 27497 transitions. Word has length 184 [2021-06-05 18:05:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:05:11,817 INFO L482 AbstractCegarLoop]: Abstraction has 10699 states and 27497 transitions. [2021-06-05 18:05:11,818 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 27497 transitions. [2021-06-05 18:05:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:05:11,826 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:05:11,826 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:05:11,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 18:05:11,827 INFO L430 AbstractCegarLoop]: === Iteration 41 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:05:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:05:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1699994247, now seen corresponding path program 29 times [2021-06-05 18:05:11,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:05:11,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600112730] [2021-06-05 18:05:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:05:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:05:12,382 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:05:12,571 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 18:05:12,754 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 18:05:13,389 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 18:05:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:05:16,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:05:16,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600112730] [2021-06-05 18:05:16,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600112730] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:05:16,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:05:16,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 18:05:16,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351522186] [2021-06-05 18:05:16,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 18:05:16,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:05:16,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 18:05:16,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:05:16,017 INFO L87 Difference]: Start difference. First operand 10699 states and 27497 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:19,619 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 18:05:20,205 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 18:05:25,718 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 18:05:28,214 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 18:05:29,457 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 18:05:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 18:05:30,557 INFO L93 Difference]: Finished difference Result 15308 states and 39328 transitions. [2021-06-05 18:05:30,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-05 18:05:30,558 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-06-05 18:05:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 18:05:30,573 INFO L225 Difference]: With dead ends: 15308 [2021-06-05 18:05:30,573 INFO L226 Difference]: Without dead ends: 14888 [2021-06-05 18:05:30,574 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3370 ImplicationChecksByTransitivity, 11149.8ms TimeCoverageRelationStatistics Valid=1126, Invalid=10864, Unknown=0, NotChecked=0, Total=11990 [2021-06-05 18:05:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14888 states. [2021-06-05 18:05:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14888 to 10694. [2021-06-05 18:05:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10694 states, 10692 states have (on average 2.570145903479237) internal successors, (27480), 10693 states have internal predecessors, (27480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10694 states to 10694 states and 27480 transitions. [2021-06-05 18:05:30,714 INFO L78 Accepts]: Start accepts. Automaton has 10694 states and 27480 transitions. Word has length 184 [2021-06-05 18:05:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 18:05:30,715 INFO L482 AbstractCegarLoop]: Abstraction has 10694 states and 27480 transitions. [2021-06-05 18:05:30,715 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 10694 states and 27480 transitions. [2021-06-05 18:05:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-06-05 18:05:30,723 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 18:05:30,723 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 18:05:30,723 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-05 18:05:30,723 INFO L430 AbstractCegarLoop]: === Iteration 42 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 18:05:30,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 18:05:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash 946648589, now seen corresponding path program 30 times [2021-06-05 18:05:30,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 18:05:30,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023816605] [2021-06-05 18:05:30,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 18:05:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 18:05:31,367 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-06-05 18:05:31,513 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-06-05 18:05:31,679 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2021-06-05 18:05:32,225 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 18:05:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 18:05:34,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 18:05:34,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023816605] [2021-06-05 18:05:34,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023816605] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 18:05:34,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 18:05:34,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-06-05 18:05:34,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875146023] [2021-06-05 18:05:34,417 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 18:05:34,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 18:05:34,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 18:05:34,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 18:05:34,418 INFO L87 Difference]: Start difference. First operand 10694 states and 27480 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 18:05:37,661 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2021-06-05 18:05:38,181 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2021-06-05 18:05:39,863 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2021-06-05 18:05:40,533 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2021-06-05 18:05:46,307 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 18:05:50,193 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 Received shutdown request... [2021-06-05 18:05:50,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 18:05:50,255 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-05 18:05:50,255 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 18:05:50,255 INFO L301 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/5) [2021-06-05 18:05:50,256 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:05:50,257 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:05:50,257 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:05:50,257 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:05:50,257 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:05:50,257 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:05:50,257 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:05:50,257 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:05:50,257 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t1======== [2021-06-05 18:05:50,259 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 18:05:50,260 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 18:05:50,260 INFO L301 ceAbstractionStarter]: Result for error location t1 was TIMEOUT (4/5) [2021-06-05 18:05:50,261 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 18:05:50,261 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 18:05:50,261 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 18:05:50,261 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 18:05:50,261 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 18:05:50,261 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 18:05:50,261 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 18:05:50,261 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 18:05:50,261 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t2======== [2021-06-05 18:05:50,263 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 247 places, 257 transitions, 536 flow [2021-06-05 18:05:50,263 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 18:05:50,263 INFO L301 ceAbstractionStarter]: Result for error location t2 was TIMEOUT (5/5) [2021-06-05 18:05:50,263 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 18:05:50,265 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 18:05:50,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 06:05:50 BasicIcfg [2021-06-05 18:05:50,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 18:05:50,266 INFO L168 Benchmark]: Toolchain (without parser) took 761477.55 ms. Allocated memory was 352.3 MB in the beginning and 5.8 GB in the end (delta: 5.5 GB). Free memory was 313.7 MB in the beginning and 5.3 GB in the end (delta: -5.0 GB). Peak memory consumption was 459.2 MB. Max. memory is 16.0 GB. [2021-06-05 18:05:50,266 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 352.3 MB. Free memory is still 332.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 18:05:50,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.96 ms. Allocated memory is still 352.3 MB. Free memory was 313.6 MB in the beginning and 286.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.0 GB. [2021-06-05 18:05:50,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.20 ms. Allocated memory is still 352.3 MB. Free memory was 286.7 MB in the beginning and 283.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 18:05:50,266 INFO L168 Benchmark]: Boogie Preprocessor took 33.14 ms. Allocated memory is still 352.3 MB. Free memory was 283.5 MB in the beginning and 281.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 18:05:50,267 INFO L168 Benchmark]: RCFGBuilder took 772.85 ms. Allocated memory is still 352.3 MB. Free memory was 281.4 MB in the beginning and 233.2 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. [2021-06-05 18:05:50,267 INFO L168 Benchmark]: TraceAbstraction took 759945.49 ms. Allocated memory was 352.3 MB in the beginning and 5.8 GB in the end (delta: 5.5 GB). Free memory was 233.2 MB in the beginning and 5.3 GB in the end (delta: -5.1 GB). Peak memory consumption was 378.3 MB. Max. memory is 16.0 GB. [2021-06-05 18:05:50,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 352.3 MB. Free memory is still 332.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 672.96 ms. Allocated memory is still 352.3 MB. Free memory was 313.6 MB in the beginning and 286.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.20 ms. Allocated memory is still 352.3 MB. Free memory was 286.7 MB in the beginning and 283.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 33.14 ms. Allocated memory is still 352.3 MB. Free memory was 283.5 MB in the beginning and 281.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 772.85 ms. Allocated memory is still 352.3 MB. Free memory was 281.4 MB in the beginning and 233.2 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 759945.49 ms. Allocated memory was 352.3 MB in the beginning and 5.8 GB in the end (delta: 5.5 GB). Free memory was 233.2 MB in the beginning and 5.3 GB in the end (delta: -5.1 GB). Peak memory consumption was 378.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 247 places, 257 transitions, 536 flow. Already constructed 2 states. Currently 1 states in worklist.. - PositiveResult [Line: 1059]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (10694states) and FLOYD_HOARE automaton (currently 50 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 93 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 35639.5ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 262.1ms, AutomataDifference: 22371.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1181.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4590 SDtfs, 20778 SDslu, 39165 SDs, 0 SdLazy, 14629 SolverSat, 914 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6764.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 463 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 16263.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 274, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 4735.9ms AutomataMinimizationTime, 15 MinimizatonAttempts, 24368 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 56.1ms SsaConstructionTime, 407.8ms SatisfiabilityAnalysisTime, 6375.0ms InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1579 ConstructedInterpolants, 0 QuantifiedInterpolants, 17010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 941.1ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 31.4ms, AutomataDifference: 123.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 770.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 244 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0ms SsaConstructionTime, 2.9ms SatisfiabilityAnalysisTime, 6.3ms InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 723142.3ms, OverallIterations: 42, TraceHistogramMax: 1, EmptinessCheckTime: 371.4ms, AutomataDifference: 559477.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 527.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 18688 SDtfs, 103591 SDslu, 431321 SDs, 0 SdLazy, 210248 SolverSat, 5643 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 222999.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5206 GetRequests, 653 SyntacticMatches, 261 SemanticMatches, 4291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142466 ImplicationChecksByTransitivity, 450762.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=23654occurred in iteration=0, InterpolantAutomatonStates: 2663, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5442.1ms AutomataMinimizationTime, 41 MinimizatonAttempts, 159733 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 103.9ms SsaConstructionTime, 908.4ms SatisfiabilityAnalysisTime, 156022.1ms InterpolantComputationTime, 7460 NumberOfCodeBlocks, 7460 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 7418 ConstructedInterpolants, 0 QuantifiedInterpolants, 549178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1 with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 3.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2 with 1 thread instances CFG has 5 procedures, 402 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown