/usr/bin/java -Xmx8000000000 -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-divine/divinefifo-bug_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 21:50:50,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:50:50,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:50:50,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:50:50,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:50:50,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:50:50,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:50:50,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:50:50,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:50:50,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:50:50,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:50:50,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:50:50,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:50:50,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:50:50,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:50:50,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:50:50,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:50:50,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:50:50,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:50:50,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:50:50,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:50:50,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:50:50,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:50:50,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:50:50,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:50:50,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:50:50,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:50:50,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:50:50,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:50:50,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:50:50,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:50:50,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:50:50,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:50:50,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:50:50,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:50:50,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:50:50,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:50:50,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:50:50,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:50:50,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:50:50,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:50:50,796 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 [2022-02-10 21:50:50,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:50:50,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:50:50,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:50:50,818 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:50:50,819 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:50:50,819 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:50:50,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:50:50,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:50:50,820 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:50:50,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:50:50,820 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:50:50,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:50:50,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:50:50,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:50:50,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:50:50,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:50:50,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:50:50,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:50:50,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:50:50,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:50:50,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:50:50,823 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:50:50,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:50:50,823 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 [2022-02-10 21:50:51,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:50:51,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:50:51,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:50:51,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:50:51,044 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:50:51,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2022-02-10 21:50:51,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730c02c28/f20f8d9f2a0b4a7e8e76fa4bb4367f40/FLAG4ae1f39e1 [2022-02-10 21:50:51,482 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:50:51,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2022-02-10 21:50:51,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730c02c28/f20f8d9f2a0b4a7e8e76fa4bb4367f40/FLAG4ae1f39e1 [2022-02-10 21:50:51,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730c02c28/f20f8d9f2a0b4a7e8e76fa4bb4367f40 [2022-02-10 21:50:51,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:50:51,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:50:51,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:50:51,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:50:51,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:50:51,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:50:51" (1/1) ... [2022-02-10 21:50:51,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60140a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:51, skipping insertion in model container [2022-02-10 21:50:51,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:50:51" (1/1) ... [2022-02-10 21:50:51,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:50:51,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:50:52,046 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-10 21:50:52,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2022-02-10 21:50:52,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2022-02-10 21:50:52,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2022-02-10 21:50:52,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2022-02-10 21:50:52,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2022-02-10 21:50:52,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2022-02-10 21:50:52,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2022-02-10 21:50:52,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2022-02-10 21:50:52,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2022-02-10 21:50:52,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:50:52,325 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:50:52,337 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-10 21:50:52,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[47275,47288] [2022-02-10 21:50:52,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[47463,47476] [2022-02-10 21:50:52,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[48230,48243] [2022-02-10 21:50:52,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[48344,48357] [2022-02-10 21:50:52,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[48816,48829] [2022-02-10 21:50:52,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[48872,48885] [2022-02-10 21:50:52,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[49384,49397] [2022-02-10 21:50:52,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[49443,49456] [2022-02-10 21:50:52,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i[49522,49535] [2022-02-10 21:50:52,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:50:52,427 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:50:52,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52 WrapperNode [2022-02-10 21:50:52,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:50:52,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:50:52,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:50:52,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:50:52,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,505 INFO L137 Inliner]: procedures = 278, calls = 103, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 416 [2022-02-10 21:50:52,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:50:52,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:50:52,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:50:52,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:50:52,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:50:52,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:50:52,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:50:52,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:50:52,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (1/1) ... [2022-02-10 21:50:52,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:50:52,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:50:52,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-10 21:50:52,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-10 21:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-02-10 21:50:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-02-10 21:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-10 21:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 21:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-10 21:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:50:52,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-10 21:50:52,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:50:52,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:50:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:50:52,628 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 21:50:52,740 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:50:52,741 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:50:53,088 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:50:53,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:50:53,096 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-10 21:50:53,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:50:53 BoogieIcfgContainer [2022-02-10 21:50:53,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:50:53,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:50:53,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:50:53,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:50:53,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:50:51" (1/3) ... [2022-02-10 21:50:53,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142f9be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:50:53, skipping insertion in model container [2022-02-10 21:50:53,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:50:52" (2/3) ... [2022-02-10 21:50:53,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142f9be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:50:53, skipping insertion in model container [2022-02-10 21:50:53,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:50:53" (3/3) ... [2022-02-10 21:50:53,103 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2022-02-10 21:50:53,107 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:50:53,107 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:50:53,107 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-10 21:50:53,107 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:50:53,178 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#in~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,178 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#in~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,178 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,178 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,179 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#in~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,179 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#in~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,179 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,179 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,179 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,179 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,180 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,180 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,180 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,180 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,180 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,180 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,180 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,181 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,181 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,181 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,181 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,181 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,182 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,183 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,183 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,183 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,183 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,183 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,183 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,183 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,184 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,184 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,184 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,184 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,184 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,184 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,184 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,184 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,184 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,185 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,185 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,185 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,185 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,185 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,185 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,185 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,186 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,186 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,186 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,186 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,186 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,186 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,187 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,187 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,187 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,187 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,187 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,187 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,187 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,187 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,188 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,188 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,189 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,189 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,191 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,194 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,195 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,195 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,195 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,195 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,195 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,195 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,195 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,196 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,196 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,196 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,196 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,196 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,196 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,196 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,197 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,198 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,199 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,199 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,199 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,199 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,199 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,199 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,199 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,199 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,199 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,200 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,201 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,201 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,201 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,201 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,201 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,201 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,201 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,202 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,203 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,203 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,203 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,203 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,203 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,203 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,203 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,203 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,204 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,204 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,205 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,205 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,205 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,205 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,205 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,205 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,206 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,207 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,208 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,208 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,208 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,208 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,209 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,209 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,209 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,210 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,211 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,211 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,211 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,211 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,211 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,211 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,212 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,214 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,215 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,215 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,215 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,215 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,215 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,215 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,216 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,217 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,218 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,218 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,218 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,218 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,218 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,218 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,218 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,218 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,219 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,219 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,219 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,219 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,219 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,219 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,224 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,224 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,224 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,225 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,225 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,225 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,225 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,225 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,225 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,225 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,225 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,226 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,226 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,226 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,226 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,227 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,227 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,227 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,227 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,227 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,227 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,227 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,227 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,229 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,230 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,230 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,230 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,230 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,230 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,230 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,230 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,230 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,230 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,231 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,232 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,233 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,233 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,233 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,233 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,233 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,233 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,233 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,233 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,233 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,234 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,234 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,234 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,234 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,234 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,234 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,234 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,235 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,236 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,237 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,239 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,239 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,239 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,239 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,239 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,239 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,240 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,240 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,241 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,241 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,241 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,241 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,241 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,241 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,242 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,242 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,242 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,242 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,242 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,242 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,242 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,242 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,243 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,243 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,243 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,243 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,243 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,243 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,244 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,244 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,244 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,244 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,245 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,245 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,247 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,248 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,248 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,248 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,248 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,248 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#t~pre63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,248 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,248 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem22#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,249 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem27#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_~self#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem20#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem25#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,250 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem21#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~pre28#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,251 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q_#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,254 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~malloc23#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,254 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_node_init_#in~self#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,254 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,254 WARN L322 ript$VariableManager]: TermVariable |pusherThread1of1ForFork0_~q~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:50:53,258 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-10 21:50:53,296 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:50:53,303 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 21:50:53,303 INFO L340 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-02-10 21:50:53,321 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 478 places, 507 transitions, 1022 flow [2022-02-10 21:50:53,639 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16416 states, 16405 states have (on average 2.120755867113685) internal successors, (34791), 16415 states have internal predecessors, (34791), 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) [2022-02-10 21:50:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 16416 states, 16405 states have (on average 2.120755867113685) internal successors, (34791), 16415 states have internal predecessors, (34791), 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) [2022-02-10 21:50:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-10 21:50:53,675 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:50:53,676 INFO L515 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] [2022-02-10 21:50:53,677 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:50:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:50:53,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1954338316, now seen corresponding path program 1 times [2022-02-10 21:50:53,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:50:53,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581321803] [2022-02-10 21:50:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:50:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:50:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:50:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:50:54,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:50:54,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581321803] [2022-02-10 21:50:54,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581321803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:50:54,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:50:54,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-10 21:50:54,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373230279] [2022-02-10 21:50:54,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:50:54,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-10 21:50:54,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:50:54,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-10 21:50:54,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-02-10 21:50:54,249 INFO L87 Difference]: Start difference. First operand has 16416 states, 16405 states have (on average 2.120755867113685) internal successors, (34791), 16415 states have internal predecessors, (34791), 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 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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) [2022-02-10 21:50:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:50:55,066 INFO L93 Difference]: Finished difference Result 16416 states and 33910 transitions. [2022-02-10 21:50:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 21:50:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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 62 [2022-02-10 21:50:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:50:55,155 INFO L225 Difference]: With dead ends: 16416 [2022-02-10 21:50:55,156 INFO L226 Difference]: Without dead ends: 16416 [2022-02-10 21:50:55,158 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2022-02-10 21:50:55,163 INFO L934 BasicCegarLoop]: 512 mSDtfsCounter, 1529 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 3323 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 21:50:55,164 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 3323 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 21:50:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16416 states. [2022-02-10 21:50:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16416 to 16416. [2022-02-10 21:50:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16416 states, 16405 states have (on average 2.067052727826882) internal successors, (33910), 16415 states have internal predecessors, (33910), 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) [2022-02-10 21:50:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16416 states to 16416 states and 33910 transitions. [2022-02-10 21:50:55,758 INFO L78 Accepts]: Start accepts. Automaton has 16416 states and 33910 transitions. Word has length 62 [2022-02-10 21:50:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:50:55,758 INFO L470 AbstractCegarLoop]: Abstraction has 16416 states and 33910 transitions. [2022-02-10 21:50:55,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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) [2022-02-10 21:50:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 16416 states and 33910 transitions. [2022-02-10 21:50:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-10 21:50:55,760 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:50:55,760 INFO L515 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] [2022-02-10 21:50:55,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:50:55,760 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:50:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:50:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1408163568, now seen corresponding path program 1 times [2022-02-10 21:50:55,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:50:55,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106966524] [2022-02-10 21:50:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:50:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:50:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:50:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:50:56,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:50:56,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106966524] [2022-02-10 21:50:56,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106966524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:50:56,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:50:56,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-02-10 21:50:56,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597044365] [2022-02-10 21:50:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:50:56,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-10 21:50:56,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:50:56,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-10 21:50:56,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-02-10 21:50:56,270 INFO L87 Difference]: Start difference. First operand 16416 states and 33910 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 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) [2022-02-10 21:50:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:50:58,930 INFO L93 Difference]: Finished difference Result 34092 states and 70649 transitions. [2022-02-10 21:50:58,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-10 21:50:58,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 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 67 [2022-02-10 21:50:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:50:59,022 INFO L225 Difference]: With dead ends: 34092 [2022-02-10 21:50:59,022 INFO L226 Difference]: Without dead ends: 34092 [2022-02-10 21:50:59,023 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=576, Invalid=1974, Unknown=0, NotChecked=0, Total=2550 [2022-02-10 21:50:59,024 INFO L934 BasicCegarLoop]: 493 mSDtfsCounter, 3839 mSDsluCounter, 7420 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3839 SdHoareTripleChecker+Valid, 7895 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-10 21:50:59,024 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3839 Valid, 7895 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-10 21:50:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34092 states. [2022-02-10 21:50:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34092 to 16414. [2022-02-10 21:50:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16414 states, 16404 states have (on average 2.0670568154108753) internal successors, (33908), 16413 states have internal predecessors, (33908), 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) [2022-02-10 21:50:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16414 states to 16414 states and 33908 transitions. [2022-02-10 21:50:59,531 INFO L78 Accepts]: Start accepts. Automaton has 16414 states and 33908 transitions. Word has length 67 [2022-02-10 21:50:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:50:59,531 INFO L470 AbstractCegarLoop]: Abstraction has 16414 states and 33908 transitions. [2022-02-10 21:50:59,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 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) [2022-02-10 21:50:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 16414 states and 33908 transitions. [2022-02-10 21:50:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-10 21:50:59,535 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:50:59,535 INFO L515 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] [2022-02-10 21:50:59,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:50:59,535 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:50:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:50:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1612565280, now seen corresponding path program 1 times [2022-02-10 21:50:59,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:50:59,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941648762] [2022-02-10 21:50:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:50:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:50:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:50:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:50:59,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:50:59,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941648762] [2022-02-10 21:50:59,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941648762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:50:59,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:50:59,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 21:50:59,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072621130] [2022-02-10 21:50:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:50:59,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-10 21:50:59,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:50:59,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-10 21:50:59,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-10 21:50:59,590 INFO L87 Difference]: Start difference. First operand 16414 states and 33908 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2022-02-10 21:50:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:50:59,668 INFO L93 Difference]: Finished difference Result 18600 states and 38301 transitions. [2022-02-10 21:50:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-10 21:50:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 94 [2022-02-10 21:50:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:50:59,710 INFO L225 Difference]: With dead ends: 18600 [2022-02-10 21:50:59,710 INFO L226 Difference]: Without dead ends: 18600 [2022-02-10 21:50:59,710 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:50:59,711 INFO L934 BasicCegarLoop]: 741 mSDtfsCounter, 863 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:50:59,711 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [863 Valid, 1904 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 21:50:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18600 states. [2022-02-10 21:51:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18600 to 16414. [2022-02-10 21:51:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16414 states, 16404 states have (on average 2.063338210192636) internal successors, (33847), 16413 states have internal predecessors, (33847), 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) [2022-02-10 21:51:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16414 states to 16414 states and 33847 transitions. [2022-02-10 21:51:00,167 INFO L78 Accepts]: Start accepts. Automaton has 16414 states and 33847 transitions. Word has length 94 [2022-02-10 21:51:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:51:00,168 INFO L470 AbstractCegarLoop]: Abstraction has 16414 states and 33847 transitions. [2022-02-10 21:51:00,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2022-02-10 21:51:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 16414 states and 33847 transitions. [2022-02-10 21:51:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-10 21:51:00,170 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:51:00,171 INFO L515 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] [2022-02-10 21:51:00,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:51:00,171 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:51:00,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:51:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 519425822, now seen corresponding path program 1 times [2022-02-10 21:51:00,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:51:00,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269139277] [2022-02-10 21:51:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:51:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:51:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:51:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:51:00,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:51:00,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269139277] [2022-02-10 21:51:00,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269139277] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:51:00,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:51:00,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 21:51:00,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236836715] [2022-02-10 21:51:00,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:51:00,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:51:00,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:51:00,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:51:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:51:00,216 INFO L87 Difference]: Start difference. First operand 16414 states and 33847 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-02-10 21:51:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:51:00,322 INFO L93 Difference]: Finished difference Result 30627 states and 63288 transitions. [2022-02-10 21:51:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:51:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2022-02-10 21:51:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:51:00,377 INFO L225 Difference]: With dead ends: 30627 [2022-02-10 21:51:00,377 INFO L226 Difference]: Without dead ends: 30627 [2022-02-10 21:51:00,377 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:51:00,378 INFO L934 BasicCegarLoop]: 525 mSDtfsCounter, 304 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:51:00,378 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 984 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 21:51:00,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30627 states. [2022-02-10 21:51:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30627 to 16475. [2022-02-10 21:51:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16475 states, 16465 states have (on average 2.0632250227755846) internal successors, (33971), 16474 states have internal predecessors, (33971), 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) [2022-02-10 21:51:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16475 states to 16475 states and 33971 transitions. [2022-02-10 21:51:00,938 INFO L78 Accepts]: Start accepts. Automaton has 16475 states and 33971 transitions. Word has length 101 [2022-02-10 21:51:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:51:00,939 INFO L470 AbstractCegarLoop]: Abstraction has 16475 states and 33971 transitions. [2022-02-10 21:51:00,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-02-10 21:51:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 16475 states and 33971 transitions. [2022-02-10 21:51:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-10 21:51:00,942 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:51:00,942 INFO L515 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] [2022-02-10 21:51:00,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 21:51:00,943 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:51:00,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:51:00,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2048381946, now seen corresponding path program 1 times [2022-02-10 21:51:00,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:51:00,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569677656] [2022-02-10 21:51:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:51:00,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:51:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:51:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:51:01,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:51:01,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569677656] [2022-02-10 21:51:01,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569677656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:51:01,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:51:01,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-10 21:51:01,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378549313] [2022-02-10 21:51:01,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:51:01,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-10 21:51:01,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:51:01,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-10 21:51:01,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-02-10 21:51:01,284 INFO L87 Difference]: Start difference. First operand 16475 states and 33971 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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) [2022-02-10 21:51:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:51:02,509 INFO L93 Difference]: Finished difference Result 37659 states and 77749 transitions. [2022-02-10 21:51:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-10 21:51:02,510 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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 114 [2022-02-10 21:51:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:51:02,575 INFO L225 Difference]: With dead ends: 37659 [2022-02-10 21:51:02,575 INFO L226 Difference]: Without dead ends: 37659 [2022-02-10 21:51:02,575 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 21:51:02,576 INFO L934 BasicCegarLoop]: 562 mSDtfsCounter, 3460 mSDsluCounter, 5064 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3460 SdHoareTripleChecker+Valid, 5615 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 21:51:02,576 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3460 Valid, 5615 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 21:51:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37659 states. [2022-02-10 21:51:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37659 to 18029. [2022-02-10 21:51:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18029 states, 18019 states have (on average 2.0641545035795548) internal successors, (37194), 18028 states have internal predecessors, (37194), 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) [2022-02-10 21:51:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18029 states to 18029 states and 37194 transitions. [2022-02-10 21:51:03,067 INFO L78 Accepts]: Start accepts. Automaton has 18029 states and 37194 transitions. Word has length 114 [2022-02-10 21:51:03,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:51:03,067 INFO L470 AbstractCegarLoop]: Abstraction has 18029 states and 37194 transitions. [2022-02-10 21:51:03,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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) [2022-02-10 21:51:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 18029 states and 37194 transitions. [2022-02-10 21:51:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-02-10 21:51:03,075 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:51:03,075 INFO L515 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] [2022-02-10 21:51:03,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:51:03,076 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:51:03,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:51:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1009639929, now seen corresponding path program 1 times [2022-02-10 21:51:03,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:51:03,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245682700] [2022-02-10 21:51:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:51:03,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:51:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:51:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:51:03,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:51:03,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245682700] [2022-02-10 21:51:03,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245682700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:51:03,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:51:03,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 21:51:03,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463282273] [2022-02-10 21:51:03,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:51:03,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-10 21:51:03,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:51:03,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-10 21:51:03,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-10 21:51:03,176 INFO L87 Difference]: Start difference. First operand 18029 states and 37194 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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) [2022-02-10 21:51:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:51:03,419 INFO L93 Difference]: Finished difference Result 32198 states and 66354 transitions. [2022-02-10 21:51:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 21:51:03,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 135 [2022-02-10 21:51:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:51:03,479 INFO L225 Difference]: With dead ends: 32198 [2022-02-10 21:51:03,479 INFO L226 Difference]: Without dead ends: 32198 [2022-02-10 21:51:03,480 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:51:03,480 INFO L934 BasicCegarLoop]: 657 mSDtfsCounter, 536 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:51:03,480 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [536 Valid, 2317 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:51:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32198 states. [2022-02-10 21:51:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32198 to 18700. [2022-02-10 21:51:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18700 states, 18690 states have (on average 2.06302835741038) internal successors, (38558), 18699 states have internal predecessors, (38558), 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) [2022-02-10 21:51:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18700 states to 18700 states and 38558 transitions. [2022-02-10 21:51:03,861 INFO L78 Accepts]: Start accepts. Automaton has 18700 states and 38558 transitions. Word has length 135 [2022-02-10 21:51:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:51:03,862 INFO L470 AbstractCegarLoop]: Abstraction has 18700 states and 38558 transitions. [2022-02-10 21:51:03,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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) [2022-02-10 21:51:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 18700 states and 38558 transitions. [2022-02-10 21:51:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:51:03,869 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:51:03,869 INFO L515 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] [2022-02-10 21:51:03,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:51:03,869 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:51:03,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:51:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 436718945, now seen corresponding path program 1 times [2022-02-10 21:51:03,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:51:03,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559256074] [2022-02-10 21:51:03,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:51:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:51:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:51:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:51:05,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:51:05,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559256074] [2022-02-10 21:51:05,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559256074] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:51:05,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:51:05,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-02-10 21:51:05,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467858139] [2022-02-10 21:51:05,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:51:05,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-10 21:51:05,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:51:05,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-10 21:51:05,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1197, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 21:51:05,334 INFO L87 Difference]: Start difference. First operand 18700 states and 38558 transitions. Second operand has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 21:51:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:51:27,604 INFO L93 Difference]: Finished difference Result 56389 states and 116103 transitions. [2022-02-10 21:51:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-02-10 21:51:27,604 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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 136 [2022-02-10 21:51:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:51:27,703 INFO L225 Difference]: With dead ends: 56389 [2022-02-10 21:51:27,703 INFO L226 Difference]: Without dead ends: 56389 [2022-02-10 21:51:27,707 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5785 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=3458, Invalid=16282, Unknown=0, NotChecked=0, Total=19740 [2022-02-10 21:51:27,707 INFO L934 BasicCegarLoop]: 1296 mSDtfsCounter, 9998 mSDsluCounter, 24464 mSDsCounter, 0 mSdLazyCounter, 10705 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9998 SdHoareTripleChecker+Valid, 25736 SdHoareTripleChecker+Invalid, 10941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 10705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:51:27,707 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [9998 Valid, 25736 Invalid, 10941 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [236 Valid, 10705 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-02-10 21:51:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56389 states. [2022-02-10 21:51:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56389 to 18911. [2022-02-10 21:51:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18911 states, 18901 states have (on average 2.063065446272684) internal successors, (38994), 18910 states have internal predecessors, (38994), 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) [2022-02-10 21:51:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18911 states to 18911 states and 38994 transitions. [2022-02-10 21:51:28,199 INFO L78 Accepts]: Start accepts. Automaton has 18911 states and 38994 transitions. Word has length 136 [2022-02-10 21:51:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:51:28,199 INFO L470 AbstractCegarLoop]: Abstraction has 18911 states and 38994 transitions. [2022-02-10 21:51:28,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 21:51:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 18911 states and 38994 transitions. [2022-02-10 21:51:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:51:28,206 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:51:28,206 INFO L515 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] [2022-02-10 21:51:28,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:51:28,206 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:51:28,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:51:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1848829175, now seen corresponding path program 2 times [2022-02-10 21:51:28,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:51:28,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323700246] [2022-02-10 21:51:28,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:51:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:51:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:51:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:51:29,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:51:29,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323700246] [2022-02-10 21:51:29,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323700246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:51:29,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:51:29,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-02-10 21:51:29,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618456458] [2022-02-10 21:51:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:51:29,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-10 21:51:29,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:51:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-10 21:51:29,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2022-02-10 21:51:29,694 INFO L87 Difference]: Start difference. First operand 18911 states and 38994 transitions. Second operand has 38 states, 38 states have (on average 3.5789473684210527) internal successors, (136), 38 states have internal predecessors, (136), 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) [2022-02-10 21:51:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:51:48,501 INFO L93 Difference]: Finished difference Result 50739 states and 104649 transitions. [2022-02-10 21:51:48,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-02-10 21:51:48,502 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.5789473684210527) internal successors, (136), 38 states have internal predecessors, (136), 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 136 [2022-02-10 21:51:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:51:48,591 INFO L225 Difference]: With dead ends: 50739 [2022-02-10 21:51:48,591 INFO L226 Difference]: Without dead ends: 50739 [2022-02-10 21:51:48,594 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4055 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=2655, Invalid=12597, Unknown=0, NotChecked=0, Total=15252 [2022-02-10 21:51:48,594 INFO L934 BasicCegarLoop]: 1309 mSDtfsCounter, 8787 mSDsluCounter, 25133 mSDsCounter, 0 mSdLazyCounter, 10118 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8787 SdHoareTripleChecker+Valid, 26414 SdHoareTripleChecker+Invalid, 10335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 10118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-02-10 21:51:48,594 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [8787 Valid, 26414 Invalid, 10335 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [217 Valid, 10118 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-02-10 21:51:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50739 states. [2022-02-10 21:51:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50739 to 18945. [2022-02-10 21:51:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18945 states, 18935 states have (on average 2.0630578294164246) internal successors, (39064), 18944 states have internal predecessors, (39064), 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) [2022-02-10 21:51:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18945 states to 18945 states and 39064 transitions. [2022-02-10 21:51:49,042 INFO L78 Accepts]: Start accepts. Automaton has 18945 states and 39064 transitions. Word has length 136 [2022-02-10 21:51:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:51:49,043 INFO L470 AbstractCegarLoop]: Abstraction has 18945 states and 39064 transitions. [2022-02-10 21:51:49,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.5789473684210527) internal successors, (136), 38 states have internal predecessors, (136), 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) [2022-02-10 21:51:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 18945 states and 39064 transitions. [2022-02-10 21:51:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:51:49,049 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:51:49,049 INFO L515 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] [2022-02-10 21:51:49,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:51:49,049 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:51:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:51:49,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1206366947, now seen corresponding path program 3 times [2022-02-10 21:51:49,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:51:49,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561969432] [2022-02-10 21:51:49,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:51:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:51:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:51:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:51:50,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:51:50,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561969432] [2022-02-10 21:51:50,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561969432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:51:50,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:51:50,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-02-10 21:51:50,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107936533] [2022-02-10 21:51:50,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:51:50,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-10 21:51:50,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:51:50,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-10 21:51:50,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1200, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 21:51:50,170 INFO L87 Difference]: Start difference. First operand 18945 states and 39064 transitions. Second operand has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 21:52:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:52:13,208 INFO L93 Difference]: Finished difference Result 50910 states and 104995 transitions. [2022-02-10 21:52:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-02-10 21:52:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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 136 [2022-02-10 21:52:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:52:13,312 INFO L225 Difference]: With dead ends: 50910 [2022-02-10 21:52:13,312 INFO L226 Difference]: Without dead ends: 50910 [2022-02-10 21:52:13,316 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7082 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=4323, Invalid=18629, Unknown=0, NotChecked=0, Total=22952 [2022-02-10 21:52:13,316 INFO L934 BasicCegarLoop]: 1297 mSDtfsCounter, 9446 mSDsluCounter, 21050 mSDsCounter, 0 mSdLazyCounter, 8341 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9446 SdHoareTripleChecker+Valid, 22327 SdHoareTripleChecker+Invalid, 8620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 8341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-02-10 21:52:13,316 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [9446 Valid, 22327 Invalid, 8620 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [279 Valid, 8341 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-02-10 21:52:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50910 states. [2022-02-10 21:52:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50910 to 19139. [2022-02-10 21:52:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19139 states, 19129 states have (on average 2.0633592974018504) internal successors, (39470), 19138 states have internal predecessors, (39470), 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) [2022-02-10 21:52:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19139 states to 19139 states and 39470 transitions. [2022-02-10 21:52:13,780 INFO L78 Accepts]: Start accepts. Automaton has 19139 states and 39470 transitions. Word has length 136 [2022-02-10 21:52:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:52:13,780 INFO L470 AbstractCegarLoop]: Abstraction has 19139 states and 39470 transitions. [2022-02-10 21:52:13,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 21:52:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 19139 states and 39470 transitions. [2022-02-10 21:52:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:52:13,786 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:52:13,786 INFO L515 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] [2022-02-10 21:52:13,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 21:52:13,787 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:52:13,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:52:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash 231254033, now seen corresponding path program 4 times [2022-02-10 21:52:13,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:52:13,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259009127] [2022-02-10 21:52:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:52:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:52:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:52:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:52:14,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:52:14,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259009127] [2022-02-10 21:52:14,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259009127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:52:14,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:52:14,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-10 21:52:14,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747297275] [2022-02-10 21:52:14,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:52:14,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-10 21:52:14,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:52:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-10 21:52:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2022-02-10 21:52:14,380 INFO L87 Difference]: Start difference. First operand 19139 states and 39470 transitions. Second operand has 28 states, 28 states have (on average 4.857142857142857) internal successors, (136), 28 states have internal predecessors, (136), 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) [2022-02-10 21:52:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:52:25,152 INFO L93 Difference]: Finished difference Result 52842 states and 108673 transitions. [2022-02-10 21:52:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-02-10 21:52:25,152 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.857142857142857) internal successors, (136), 28 states have internal predecessors, (136), 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 136 [2022-02-10 21:52:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:52:25,242 INFO L225 Difference]: With dead ends: 52842 [2022-02-10 21:52:25,242 INFO L226 Difference]: Without dead ends: 52842 [2022-02-10 21:52:25,244 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2683, Invalid=10889, Unknown=0, NotChecked=0, Total=13572 [2022-02-10 21:52:25,244 INFO L934 BasicCegarLoop]: 1161 mSDtfsCounter, 9525 mSDsluCounter, 16707 mSDsCounter, 0 mSdLazyCounter, 6982 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9525 SdHoareTripleChecker+Valid, 17840 SdHoareTripleChecker+Invalid, 7320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 6982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:52:25,244 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [9525 Valid, 17840 Invalid, 7320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 6982 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-02-10 21:52:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52842 states. [2022-02-10 21:52:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52842 to 30734. [2022-02-10 21:52:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30734 states, 30724 states have (on average 2.078895977086317) internal successors, (63872), 30733 states have internal predecessors, (63872), 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) [2022-02-10 21:52:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30734 states to 30734 states and 63872 transitions. [2022-02-10 21:52:25,942 INFO L78 Accepts]: Start accepts. Automaton has 30734 states and 63872 transitions. Word has length 136 [2022-02-10 21:52:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:52:25,943 INFO L470 AbstractCegarLoop]: Abstraction has 30734 states and 63872 transitions. [2022-02-10 21:52:25,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.857142857142857) internal successors, (136), 28 states have internal predecessors, (136), 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) [2022-02-10 21:52:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 30734 states and 63872 transitions. [2022-02-10 21:52:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:52:25,949 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:52:25,949 INFO L515 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] [2022-02-10 21:52:25,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 21:52:25,950 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:52:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:52:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1196916895, now seen corresponding path program 5 times [2022-02-10 21:52:25,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:52:25,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760747529] [2022-02-10 21:52:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:52:25,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:52:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:52:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:52:26,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:52:26,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760747529] [2022-02-10 21:52:26,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760747529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:52:26,999 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:52:26,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-02-10 21:52:26,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513840031] [2022-02-10 21:52:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:52:26,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-10 21:52:27,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:52:27,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-10 21:52:27,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2022-02-10 21:52:27,000 INFO L87 Difference]: Start difference. First operand 30734 states and 63872 transitions. Second operand has 38 states, 38 states have (on average 3.5789473684210527) internal successors, (136), 38 states have internal predecessors, (136), 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) [2022-02-10 21:52:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:52:38,604 INFO L93 Difference]: Finished difference Result 53069 states and 109214 transitions. [2022-02-10 21:52:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-02-10 21:52:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.5789473684210527) internal successors, (136), 38 states have internal predecessors, (136), 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 136 [2022-02-10 21:52:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:52:38,693 INFO L225 Difference]: With dead ends: 53069 [2022-02-10 21:52:38,693 INFO L226 Difference]: Without dead ends: 53069 [2022-02-10 21:52:38,695 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3309, Invalid=11943, Unknown=0, NotChecked=0, Total=15252 [2022-02-10 21:52:38,695 INFO L934 BasicCegarLoop]: 935 mSDtfsCounter, 9508 mSDsluCounter, 16419 mSDsCounter, 0 mSdLazyCounter, 7392 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9508 SdHoareTripleChecker+Valid, 17329 SdHoareTripleChecker+Invalid, 7691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 7392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:52:38,695 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [9508 Valid, 17329 Invalid, 7691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 7392 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-02-10 21:52:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53069 states. [2022-02-10 21:52:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53069 to 30782. [2022-02-10 21:52:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30782 states, 30772 states have (on average 2.079000389964903) internal successors, (63975), 30781 states have internal predecessors, (63975), 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) [2022-02-10 21:52:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30782 states to 30782 states and 63975 transitions. [2022-02-10 21:52:39,324 INFO L78 Accepts]: Start accepts. Automaton has 30782 states and 63975 transitions. Word has length 136 [2022-02-10 21:52:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:52:39,324 INFO L470 AbstractCegarLoop]: Abstraction has 30782 states and 63975 transitions. [2022-02-10 21:52:39,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.5789473684210527) internal successors, (136), 38 states have internal predecessors, (136), 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) [2022-02-10 21:52:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 30782 states and 63975 transitions. [2022-02-10 21:52:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:52:39,330 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:52:39,330 INFO L515 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] [2022-02-10 21:52:39,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-10 21:52:39,330 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:52:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:52:39,331 INFO L85 PathProgramCache]: Analyzing trace with hash 358590301, now seen corresponding path program 6 times [2022-02-10 21:52:39,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:52:39,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066508308] [2022-02-10 21:52:39,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:52:39,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:52:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:52:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:52:40,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:52:40,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066508308] [2022-02-10 21:52:40,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066508308] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:52:40,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:52:40,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-02-10 21:52:40,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620231255] [2022-02-10 21:52:40,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:52:40,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 21:52:40,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:52:40,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 21:52:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1345, Unknown=0, NotChecked=0, Total=1482 [2022-02-10 21:52:40,650 INFO L87 Difference]: Start difference. First operand 30782 states and 63975 transitions. Second operand has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:53:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:53:03,172 INFO L93 Difference]: Finished difference Result 54282 states and 111648 transitions. [2022-02-10 21:53:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-10 21:53:03,172 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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 136 [2022-02-10 21:53:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:53:03,263 INFO L225 Difference]: With dead ends: 54282 [2022-02-10 21:53:03,264 INFO L226 Difference]: Without dead ends: 54282 [2022-02-10 21:53:03,265 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5587 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=3415, Invalid=16045, Unknown=0, NotChecked=0, Total=19460 [2022-02-10 21:53:03,265 INFO L934 BasicCegarLoop]: 1351 mSDtfsCounter, 8812 mSDsluCounter, 25723 mSDsCounter, 0 mSdLazyCounter, 11111 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8812 SdHoareTripleChecker+Valid, 27049 SdHoareTripleChecker+Invalid, 11336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 11111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:53:03,265 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [8812 Valid, 27049 Invalid, 11336 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [225 Valid, 11111 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-02-10 21:53:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54282 states. [2022-02-10 21:53:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54282 to 30966. [2022-02-10 21:53:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30966 states, 30956 states have (on average 2.078724641426541) internal successors, (64349), 30965 states have internal predecessors, (64349), 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) [2022-02-10 21:53:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30966 states to 30966 states and 64349 transitions. [2022-02-10 21:53:03,867 INFO L78 Accepts]: Start accepts. Automaton has 30966 states and 64349 transitions. Word has length 136 [2022-02-10 21:53:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:53:03,867 INFO L470 AbstractCegarLoop]: Abstraction has 30966 states and 64349 transitions. [2022-02-10 21:53:03,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:53:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 30966 states and 64349 transitions. [2022-02-10 21:53:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:53:03,873 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:53:03,873 INFO L515 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] [2022-02-10 21:53:03,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-10 21:53:03,873 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:53:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:53:03,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1759167749, now seen corresponding path program 7 times [2022-02-10 21:53:03,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:53:03,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951890558] [2022-02-10 21:53:03,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:53:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:53:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:53: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. [2022-02-10 21:53:05,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:53:05,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951890558] [2022-02-10 21:53:05,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951890558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:53:05,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:53:05,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-02-10 21:53:05,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290973769] [2022-02-10 21:53:05,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:53:05,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 21:53:05,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:53:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 21:53:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2022-02-10 21:53:05,309 INFO L87 Difference]: Start difference. First operand 30966 states and 64349 transitions. Second operand has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:53:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:53:27,417 INFO L93 Difference]: Finished difference Result 54074 states and 111230 transitions. [2022-02-10 21:53:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-02-10 21:53:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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 136 [2022-02-10 21:53:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:53:27,514 INFO L225 Difference]: With dead ends: 54074 [2022-02-10 21:53:27,515 INFO L226 Difference]: Without dead ends: 54074 [2022-02-10 21:53:27,516 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5446 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=3252, Invalid=15930, Unknown=0, NotChecked=0, Total=19182 [2022-02-10 21:53:27,516 INFO L934 BasicCegarLoop]: 1336 mSDtfsCounter, 8622 mSDsluCounter, 25784 mSDsCounter, 0 mSdLazyCounter, 11430 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8622 SdHoareTripleChecker+Valid, 27094 SdHoareTripleChecker+Invalid, 11656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 11430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:53:27,516 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [8622 Valid, 27094 Invalid, 11656 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [226 Valid, 11430 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-02-10 21:53:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54074 states. [2022-02-10 21:53:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54074 to 30816. [2022-02-10 21:53:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30816 states, 30806 states have (on average 2.078945659936376) internal successors, (64044), 30815 states have internal predecessors, (64044), 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) [2022-02-10 21:53:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30816 states to 30816 states and 64044 transitions. [2022-02-10 21:53:28,097 INFO L78 Accepts]: Start accepts. Automaton has 30816 states and 64044 transitions. Word has length 136 [2022-02-10 21:53:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:53:28,097 INFO L470 AbstractCegarLoop]: Abstraction has 30816 states and 64044 transitions. [2022-02-10 21:53:28,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:53:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 30816 states and 64044 transitions. [2022-02-10 21:53:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:53:28,103 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:53:28,103 INFO L515 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] [2022-02-10 21:53:28,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-10 21:53:28,103 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:53:28,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:53:28,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1335709937, now seen corresponding path program 8 times [2022-02-10 21:53:28,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:53:28,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352439906] [2022-02-10 21:53:28,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:53:28,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:53:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:53:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:53:29,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:53:29,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352439906] [2022-02-10 21:53:29,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352439906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:53:29,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:53:29,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 21:53:29,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760431657] [2022-02-10 21:53:29,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:53:29,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 21:53:29,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:53:29,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 21:53:29,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 21:53:29,373 INFO L87 Difference]: Start difference. First operand 30816 states and 64044 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:53:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:53:51,537 INFO L93 Difference]: Finished difference Result 55160 states and 113549 transitions. [2022-02-10 21:53:51,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-02-10 21:53:51,538 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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 136 [2022-02-10 21:53:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:53:51,625 INFO L225 Difference]: With dead ends: 55160 [2022-02-10 21:53:51,626 INFO L226 Difference]: Without dead ends: 55160 [2022-02-10 21:53:51,626 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4877 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=3192, Invalid=14898, Unknown=0, NotChecked=0, Total=18090 [2022-02-10 21:53:51,627 INFO L934 BasicCegarLoop]: 1314 mSDtfsCounter, 8987 mSDsluCounter, 28249 mSDsCounter, 0 mSdLazyCounter, 12128 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8987 SdHoareTripleChecker+Valid, 29534 SdHoareTripleChecker+Invalid, 12383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 12128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-10 21:53:51,627 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [8987 Valid, 29534 Invalid, 12383 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [255 Valid, 12128 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-02-10 21:53:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55160 states. [2022-02-10 21:53:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55160 to 31273. [2022-02-10 21:53:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31273 states, 31263 states have (on average 2.0792310398874068) internal successors, (65003), 31272 states have internal predecessors, (65003), 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) [2022-02-10 21:53:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31273 states to 31273 states and 65003 transitions. [2022-02-10 21:53:52,221 INFO L78 Accepts]: Start accepts. Automaton has 31273 states and 65003 transitions. Word has length 136 [2022-02-10 21:53:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:53:52,221 INFO L470 AbstractCegarLoop]: Abstraction has 31273 states and 65003 transitions. [2022-02-10 21:53:52,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:53:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 31273 states and 65003 transitions. [2022-02-10 21:53:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:53:52,228 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:53:52,228 INFO L515 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] [2022-02-10 21:53:52,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-10 21:53:52,228 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:53:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:53:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash 841499309, now seen corresponding path program 9 times [2022-02-10 21:53:52,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:53:52,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639830567] [2022-02-10 21:53:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:53:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:53:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:53:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:53:53,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:53:53,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639830567] [2022-02-10 21:53:53,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639830567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:53:53,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:53:53,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-02-10 21:53:53,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759750437] [2022-02-10 21:53:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:53:53,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 21:53:53,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:53:53,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 21:53:53,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2022-02-10 21:53:53,505 INFO L87 Difference]: Start difference. First operand 31273 states and 65003 transitions. Second operand has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:54:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:54:17,466 INFO L93 Difference]: Finished difference Result 58207 states and 119760 transitions. [2022-02-10 21:54:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-02-10 21:54:17,467 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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 136 [2022-02-10 21:54:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:54:17,563 INFO L225 Difference]: With dead ends: 58207 [2022-02-10 21:54:17,563 INFO L226 Difference]: Without dead ends: 58207 [2022-02-10 21:54:17,564 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5952 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=3534, Invalid=17058, Unknown=0, NotChecked=0, Total=20592 [2022-02-10 21:54:17,565 INFO L934 BasicCegarLoop]: 1337 mSDtfsCounter, 9782 mSDsluCounter, 23897 mSDsCounter, 0 mSdLazyCounter, 10422 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9782 SdHoareTripleChecker+Valid, 25214 SdHoareTripleChecker+Invalid, 10704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 10422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:54:17,565 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [9782 Valid, 25214 Invalid, 10704 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [282 Valid, 10422 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-02-10 21:54:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58207 states. [2022-02-10 21:54:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58207 to 31675. [2022-02-10 21:54:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31675 states, 31665 states have (on average 2.0797410390020525) internal successors, (65855), 31674 states have internal predecessors, (65855), 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) [2022-02-10 21:54:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31675 states to 31675 states and 65855 transitions. [2022-02-10 21:54:18,216 INFO L78 Accepts]: Start accepts. Automaton has 31675 states and 65855 transitions. Word has length 136 [2022-02-10 21:54:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:54:18,216 INFO L470 AbstractCegarLoop]: Abstraction has 31675 states and 65855 transitions. [2022-02-10 21:54:18,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:54:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 31675 states and 65855 transitions. [2022-02-10 21:54:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:54:18,223 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:54:18,223 INFO L515 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] [2022-02-10 21:54:18,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-10 21:54:18,223 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:54:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:54:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1430043397, now seen corresponding path program 10 times [2022-02-10 21:54:18,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:54:18,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944679778] [2022-02-10 21:54:18,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:54:18,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:54:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:54:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:54:19,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:54:19,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944679778] [2022-02-10 21:54:19,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944679778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:54:19,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:54:19,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-02-10 21:54:19,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037450902] [2022-02-10 21:54:19,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:54:19,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-10 21:54:19,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:54:19,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-10 21:54:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2022-02-10 21:54:19,282 INFO L87 Difference]: Start difference. First operand 31675 states and 65855 transitions. Second operand has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 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) [2022-02-10 21:54:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:54:38,606 INFO L93 Difference]: Finished difference Result 55092 states and 113442 transitions. [2022-02-10 21:54:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-02-10 21:54:38,606 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 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 136 [2022-02-10 21:54:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:54:38,697 INFO L225 Difference]: With dead ends: 55092 [2022-02-10 21:54:38,697 INFO L226 Difference]: Without dead ends: 55092 [2022-02-10 21:54:38,698 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=2801, Invalid=11719, Unknown=0, NotChecked=0, Total=14520 [2022-02-10 21:54:38,698 INFO L934 BasicCegarLoop]: 1289 mSDtfsCounter, 8200 mSDsluCounter, 23558 mSDsCounter, 0 mSdLazyCounter, 9210 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8200 SdHoareTripleChecker+Valid, 24821 SdHoareTripleChecker+Invalid, 9463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 9210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:54:38,699 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [8200 Valid, 24821 Invalid, 9463 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [253 Valid, 9210 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-02-10 21:54:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55092 states. [2022-02-10 21:54:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55092 to 31729. [2022-02-10 21:54:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31729 states, 31719 states have (on average 2.0796683375894576) internal successors, (65965), 31728 states have internal predecessors, (65965), 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) [2022-02-10 21:54:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31729 states to 31729 states and 65965 transitions. [2022-02-10 21:54:39,298 INFO L78 Accepts]: Start accepts. Automaton has 31729 states and 65965 transitions. Word has length 136 [2022-02-10 21:54:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:54:39,298 INFO L470 AbstractCegarLoop]: Abstraction has 31729 states and 65965 transitions. [2022-02-10 21:54:39,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 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) [2022-02-10 21:54:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 31729 states and 65965 transitions. [2022-02-10 21:54:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:54:39,305 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:54:39,306 INFO L515 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] [2022-02-10 21:54:39,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-10 21:54:39,306 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:54:39,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:54:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash -687714653, now seen corresponding path program 11 times [2022-02-10 21:54:39,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:54:39,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622205166] [2022-02-10 21:54:39,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:54:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:54:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:54:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:54:40,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:54:40,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622205166] [2022-02-10 21:54:40,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622205166] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:54:40,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:54:40,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-02-10 21:54:40,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173975254] [2022-02-10 21:54:40,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:54:40,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 21:54:40,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:54:40,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 21:54:40,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2022-02-10 21:54:40,586 INFO L87 Difference]: Start difference. First operand 31729 states and 65965 transitions. Second operand has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:55:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:55:04,003 INFO L93 Difference]: Finished difference Result 57864 states and 119069 transitions. [2022-02-10 21:55:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-02-10 21:55:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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 136 [2022-02-10 21:55:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:55:04,103 INFO L225 Difference]: With dead ends: 57864 [2022-02-10 21:55:04,103 INFO L226 Difference]: Without dead ends: 57864 [2022-02-10 21:55:04,104 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5751 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=3459, Invalid=16563, Unknown=0, NotChecked=0, Total=20022 [2022-02-10 21:55:04,104 INFO L934 BasicCegarLoop]: 1312 mSDtfsCounter, 10237 mSDsluCounter, 24868 mSDsCounter, 0 mSdLazyCounter, 10810 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10237 SdHoareTripleChecker+Valid, 26157 SdHoareTripleChecker+Invalid, 11113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 10810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:55:04,104 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [10237 Valid, 26157 Invalid, 11113 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [303 Valid, 10810 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-02-10 21:55:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57864 states. [2022-02-10 21:55:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57864 to 31613. [2022-02-10 21:55:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31613 states, 31603 states have (on average 2.0797709078252065) internal successors, (65727), 31612 states have internal predecessors, (65727), 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) [2022-02-10 21:55:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31613 states to 31613 states and 65727 transitions. [2022-02-10 21:55:04,710 INFO L78 Accepts]: Start accepts. Automaton has 31613 states and 65727 transitions. Word has length 136 [2022-02-10 21:55:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:55:04,710 INFO L470 AbstractCegarLoop]: Abstraction has 31613 states and 65727 transitions. [2022-02-10 21:55:04,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:55:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 31613 states and 65727 transitions. [2022-02-10 21:55:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:55:04,717 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:55:04,717 INFO L515 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] [2022-02-10 21:55:04,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-10 21:55:04,717 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:55:04,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:55:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1329116971, now seen corresponding path program 12 times [2022-02-10 21:55:04,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:55:04,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132205634] [2022-02-10 21:55:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:55:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:55:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:55:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:55:05,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:55:05,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132205634] [2022-02-10 21:55:05,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132205634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:55:05,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:55:05,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 21:55:05,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959417368] [2022-02-10 21:55:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:55:05,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 21:55:05,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:55:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 21:55:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 21:55:05,975 INFO L87 Difference]: Start difference. First operand 31613 states and 65727 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:55:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:55:26,750 INFO L93 Difference]: Finished difference Result 61616 states and 126910 transitions. [2022-02-10 21:55:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-02-10 21:55:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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 136 [2022-02-10 21:55:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:55:26,848 INFO L225 Difference]: With dead ends: 61616 [2022-02-10 21:55:26,849 INFO L226 Difference]: Without dead ends: 61616 [2022-02-10 21:55:26,849 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4526 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=3069, Invalid=13961, Unknown=0, NotChecked=0, Total=17030 [2022-02-10 21:55:26,850 INFO L934 BasicCegarLoop]: 1314 mSDtfsCounter, 10095 mSDsluCounter, 26198 mSDsCounter, 0 mSdLazyCounter, 10945 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10095 SdHoareTripleChecker+Valid, 27488 SdHoareTripleChecker+Invalid, 11243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 10945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:55:26,850 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [10095 Valid, 27488 Invalid, 11243 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [298 Valid, 10945 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-02-10 21:55:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61616 states. [2022-02-10 21:55:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61616 to 32291. [2022-02-10 21:55:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32291 states, 32281 states have (on average 2.0806976239893435) internal successors, (67167), 32290 states have internal predecessors, (67167), 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) [2022-02-10 21:55:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32291 states to 32291 states and 67167 transitions. [2022-02-10 21:55:27,477 INFO L78 Accepts]: Start accepts. Automaton has 32291 states and 67167 transitions. Word has length 136 [2022-02-10 21:55:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:55:27,478 INFO L470 AbstractCegarLoop]: Abstraction has 32291 states and 67167 transitions. [2022-02-10 21:55:27,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:55:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 32291 states and 67167 transitions. [2022-02-10 21:55:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:55:27,486 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:55:27,486 INFO L515 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] [2022-02-10 21:55:27,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-10 21:55:27,487 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:55:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:55:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -788641079, now seen corresponding path program 13 times [2022-02-10 21:55:27,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:55:27,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878454494] [2022-02-10 21:55:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:55:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:55:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:55:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:55:28,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:55:28,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878454494] [2022-02-10 21:55:28,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878454494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:55:28,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:55:28,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-02-10 21:55:28,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113803692] [2022-02-10 21:55:28,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:55:28,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 21:55:28,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:55:28,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 21:55:28,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2022-02-10 21:55:28,745 INFO L87 Difference]: Start difference. First operand 32291 states and 67167 transitions. Second operand has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:55:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:55:51,589 INFO L93 Difference]: Finished difference Result 65243 states and 134331 transitions. [2022-02-10 21:55:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-02-10 21:55:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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 136 [2022-02-10 21:55:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:55:51,695 INFO L225 Difference]: With dead ends: 65243 [2022-02-10 21:55:51,695 INFO L226 Difference]: Without dead ends: 65243 [2022-02-10 21:55:51,696 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5471 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=3346, Invalid=15836, Unknown=0, NotChecked=0, Total=19182 [2022-02-10 21:55:51,696 INFO L934 BasicCegarLoop]: 1338 mSDtfsCounter, 9646 mSDsluCounter, 25523 mSDsCounter, 0 mSdLazyCounter, 11112 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9646 SdHoareTripleChecker+Valid, 26835 SdHoareTripleChecker+Invalid, 11395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 11112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:55:51,697 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [9646 Valid, 26835 Invalid, 11395 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [283 Valid, 11112 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-02-10 21:55:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65243 states. [2022-02-10 21:55:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65243 to 32965. [2022-02-10 21:55:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32965 states, 32955 states have (on average 2.0815354270975575) internal successors, (68597), 32964 states have internal predecessors, (68597), 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) [2022-02-10 21:55:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32965 states to 32965 states and 68597 transitions. [2022-02-10 21:55:52,354 INFO L78 Accepts]: Start accepts. Automaton has 32965 states and 68597 transitions. Word has length 136 [2022-02-10 21:55:52,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:55:52,354 INFO L470 AbstractCegarLoop]: Abstraction has 32965 states and 68597 transitions. [2022-02-10 21:55:52,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:55:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 32965 states and 68597 transitions. [2022-02-10 21:55:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:55:52,362 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:55:52,362 INFO L515 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] [2022-02-10 21:55:52,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-10 21:55:52,362 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:55:52,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:55:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 182030533, now seen corresponding path program 14 times [2022-02-10 21:55:52,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:55:52,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779097957] [2022-02-10 21:55:52,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:55:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:55:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:55:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:55:53,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:55:53,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779097957] [2022-02-10 21:55:53,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779097957] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:55:53,411 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:55:53,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-02-10 21:55:53,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667185671] [2022-02-10 21:55:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:55:53,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-10 21:55:53,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:55:53,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-10 21:55:53,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 21:55:53,413 INFO L87 Difference]: Start difference. First operand 32965 states and 68597 transitions. Second operand has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 21:56:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:56:10,254 INFO L93 Difference]: Finished difference Result 60787 states and 125319 transitions. [2022-02-10 21:56:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-02-10 21:56:10,254 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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 136 [2022-02-10 21:56:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:56:10,362 INFO L225 Difference]: With dead ends: 60787 [2022-02-10 21:56:10,362 INFO L226 Difference]: Without dead ends: 60787 [2022-02-10 21:56:10,363 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3659 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=2796, Invalid=11484, Unknown=0, NotChecked=0, Total=14280 [2022-02-10 21:56:10,363 INFO L934 BasicCegarLoop]: 1270 mSDtfsCounter, 8982 mSDsluCounter, 20166 mSDsCounter, 0 mSdLazyCounter, 7779 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8982 SdHoareTripleChecker+Valid, 21416 SdHoareTripleChecker+Invalid, 8072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 7779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-02-10 21:56:10,364 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [8982 Valid, 21416 Invalid, 8072 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [293 Valid, 7779 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-02-10 21:56:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60787 states. [2022-02-10 21:56:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60787 to 32735. [2022-02-10 21:56:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32735 states, 32725 states have (on average 2.0809472880061115) internal successors, (68099), 32734 states have internal predecessors, (68099), 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) [2022-02-10 21:56:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32735 states to 32735 states and 68099 transitions. [2022-02-10 21:56:11,102 INFO L78 Accepts]: Start accepts. Automaton has 32735 states and 68099 transitions. Word has length 136 [2022-02-10 21:56:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:56:11,103 INFO L470 AbstractCegarLoop]: Abstraction has 32735 states and 68099 transitions. [2022-02-10 21:56:11,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 21:56:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 32735 states and 68099 transitions. [2022-02-10 21:56:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:56:11,110 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:56:11,110 INFO L515 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] [2022-02-10 21:56:11,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-10 21:56:11,110 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:56:11,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:56:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1935727517, now seen corresponding path program 15 times [2022-02-10 21:56:11,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:56:11,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007421779] [2022-02-10 21:56:11,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:56:11,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:56:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:56:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:56:12,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:56:12,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007421779] [2022-02-10 21:56:12,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007421779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:56:12,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:56:12,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-02-10 21:56:12,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459673988] [2022-02-10 21:56:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:56:12,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-10 21:56:12,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:56:12,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-10 21:56:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1908, Unknown=0, NotChecked=0, Total=2070 [2022-02-10 21:56:12,807 INFO L87 Difference]: Start difference. First operand 32735 states and 68099 transitions. Second operand has 46 states, 46 states have (on average 2.9565217391304346) internal successors, (136), 46 states have internal predecessors, (136), 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) [2022-02-10 21:56:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:56:38,897 INFO L93 Difference]: Finished difference Result 59446 states and 122501 transitions. [2022-02-10 21:56:38,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-02-10 21:56:38,897 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.9565217391304346) internal successors, (136), 46 states have internal predecessors, (136), 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 136 [2022-02-10 21:56:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:56:38,997 INFO L225 Difference]: With dead ends: 59446 [2022-02-10 21:56:38,998 INFO L226 Difference]: Without dead ends: 59446 [2022-02-10 21:56:38,999 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6578 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=3950, Invalid=19920, Unknown=0, NotChecked=0, Total=23870 [2022-02-10 21:56:38,999 INFO L934 BasicCegarLoop]: 1334 mSDtfsCounter, 10847 mSDsluCounter, 28568 mSDsCounter, 0 mSdLazyCounter, 12939 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10847 SdHoareTripleChecker+Valid, 29872 SdHoareTripleChecker+Invalid, 13279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 12939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:56:38,999 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [10847 Valid, 29872 Invalid, 13279 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [340 Valid, 12939 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-02-10 21:56:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59446 states. [2022-02-10 21:56:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59446 to 32248. [2022-02-10 21:56:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32248 states, 32238 states have (on average 2.0805881258142565) internal successors, (67074), 32247 states have internal predecessors, (67074), 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) [2022-02-10 21:56:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32248 states to 32248 states and 67074 transitions. [2022-02-10 21:56:39,637 INFO L78 Accepts]: Start accepts. Automaton has 32248 states and 67074 transitions. Word has length 136 [2022-02-10 21:56:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:56:39,637 INFO L470 AbstractCegarLoop]: Abstraction has 32248 states and 67074 transitions. [2022-02-10 21:56:39,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.9565217391304346) internal successors, (136), 46 states have internal predecessors, (136), 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) [2022-02-10 21:56:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 32248 states and 67074 transitions. [2022-02-10 21:56:39,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:56:39,643 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:56:39,643 INFO L515 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] [2022-02-10 21:56:39,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-10 21:56:39,644 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:56:39,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:56:39,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1566607611, now seen corresponding path program 16 times [2022-02-10 21:56:39,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:56:39,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418461115] [2022-02-10 21:56:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:56:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:56:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:56:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:56:41,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:56:41,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418461115] [2022-02-10 21:56:41,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418461115] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:56:41,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:56:41,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 21:56:41,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696413142] [2022-02-10 21:56:41,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:56:41,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 21:56:41,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:56:41,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 21:56:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 21:56:41,117 INFO L87 Difference]: Start difference. First operand 32248 states and 67074 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:57:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:57:01,837 INFO L93 Difference]: Finished difference Result 65831 states and 135569 transitions. [2022-02-10 21:57:01,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-02-10 21:57:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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 136 [2022-02-10 21:57:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:57:01,951 INFO L225 Difference]: With dead ends: 65831 [2022-02-10 21:57:01,952 INFO L226 Difference]: Without dead ends: 65831 [2022-02-10 21:57:01,953 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5240 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=3357, Invalid=15275, Unknown=0, NotChecked=0, Total=18632 [2022-02-10 21:57:01,953 INFO L934 BasicCegarLoop]: 1291 mSDtfsCounter, 10390 mSDsluCounter, 25192 mSDsCounter, 0 mSdLazyCounter, 10725 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10390 SdHoareTripleChecker+Valid, 26457 SdHoareTripleChecker+Invalid, 11036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 10725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:57:01,953 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [10390 Valid, 26457 Invalid, 11036 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [311 Valid, 10725 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-02-10 21:57:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65831 states. [2022-02-10 21:57:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65831 to 32654. [2022-02-10 21:57:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32654 states, 32644 states have (on average 2.0820058816321527) internal successors, (67965), 32653 states have internal predecessors, (67965), 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) [2022-02-10 21:57:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32654 states to 32654 states and 67965 transitions. [2022-02-10 21:57:02,742 INFO L78 Accepts]: Start accepts. Automaton has 32654 states and 67965 transitions. Word has length 136 [2022-02-10 21:57:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:57:02,742 INFO L470 AbstractCegarLoop]: Abstraction has 32654 states and 67965 transitions. [2022-02-10 21:57:02,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:57:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32654 states and 67965 transitions. [2022-02-10 21:57:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:57:02,750 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:57:02,750 INFO L515 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] [2022-02-10 21:57:02,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-10 21:57:02,750 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:57:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:57:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash 610601635, now seen corresponding path program 17 times [2022-02-10 21:57:02,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:57:02,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548183009] [2022-02-10 21:57:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:57:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:57:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:57:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:57:04,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:57:04,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548183009] [2022-02-10 21:57:04,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548183009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:57:04,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:57:04,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-02-10 21:57:04,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581583942] [2022-02-10 21:57:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:57:04,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-10 21:57:04,186 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:57:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-10 21:57:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2022-02-10 21:57:04,187 INFO L87 Difference]: Start difference. First operand 32654 states and 67965 transitions. Second operand has 42 states, 42 states have (on average 3.238095238095238) internal successors, (136), 42 states have internal predecessors, (136), 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) [2022-02-10 21:57:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:57:41,825 INFO L93 Difference]: Finished difference Result 71122 states and 146287 transitions. [2022-02-10 21:57:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2022-02-10 21:57:41,826 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.238095238095238) internal successors, (136), 42 states have internal predecessors, (136), 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 136 [2022-02-10 21:57:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:57:41,950 INFO L225 Difference]: With dead ends: 71122 [2022-02-10 21:57:41,950 INFO L226 Difference]: Without dead ends: 71122 [2022-02-10 21:57:41,953 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17844 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=8140, Invalid=43162, Unknown=0, NotChecked=0, Total=51302 [2022-02-10 21:57:41,953 INFO L934 BasicCegarLoop]: 1529 mSDtfsCounter, 11989 mSDsluCounter, 32769 mSDsCounter, 0 mSdLazyCounter, 15802 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11989 SdHoareTripleChecker+Valid, 34269 SdHoareTripleChecker+Invalid, 16152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 15802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:57:41,953 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [11989 Valid, 34269 Invalid, 16152 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [350 Valid, 15802 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-02-10 21:57:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71122 states. [2022-02-10 21:57:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71122 to 33169. [2022-02-10 21:57:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33169 states, 33159 states have (on average 2.082179800355861) internal successors, (69043), 33168 states have internal predecessors, (69043), 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) [2022-02-10 21:57:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33169 states to 33169 states and 69043 transitions. [2022-02-10 21:57:42,780 INFO L78 Accepts]: Start accepts. Automaton has 33169 states and 69043 transitions. Word has length 136 [2022-02-10 21:57:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:57:42,780 INFO L470 AbstractCegarLoop]: Abstraction has 33169 states and 69043 transitions. [2022-02-10 21:57:42,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.238095238095238) internal successors, (136), 42 states have internal predecessors, (136), 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) [2022-02-10 21:57:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 33169 states and 69043 transitions. [2022-02-10 21:57:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:57:42,788 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:57:42,788 INFO L515 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] [2022-02-10 21:57:42,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-10 21:57:42,788 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:57:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:57:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash -950261609, now seen corresponding path program 18 times [2022-02-10 21:57:42,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:57:42,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096017191] [2022-02-10 21:57:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:57:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:57:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:57:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:57:44,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:57:44,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096017191] [2022-02-10 21:57:44,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096017191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:57:44,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:57:44,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 21:57:44,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908323395] [2022-02-10 21:57:44,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:57:44,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 21:57:44,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:57:44,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 21:57:44,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1407, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 21:57:44,049 INFO L87 Difference]: Start difference. First operand 33169 states and 69043 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:58:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:58:02,875 INFO L93 Difference]: Finished difference Result 54876 states and 113074 transitions. [2022-02-10 21:58:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-02-10 21:58:02,879 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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 136 [2022-02-10 21:58:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:58:02,986 INFO L225 Difference]: With dead ends: 54876 [2022-02-10 21:58:02,986 INFO L226 Difference]: Without dead ends: 54876 [2022-02-10 21:58:02,987 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4747 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=3109, Invalid=13661, Unknown=0, NotChecked=0, Total=16770 [2022-02-10 21:58:02,988 INFO L934 BasicCegarLoop]: 1291 mSDtfsCounter, 7753 mSDsluCounter, 23703 mSDsCounter, 0 mSdLazyCounter, 9279 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7753 SdHoareTripleChecker+Valid, 24970 SdHoareTripleChecker+Invalid, 9489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 9279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:58:02,988 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7753 Valid, 24970 Invalid, 9489 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [210 Valid, 9279 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-02-10 21:58:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54876 states. [2022-02-10 21:58:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54876 to 33782. [2022-02-10 21:58:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33782 states, 33772 states have (on average 2.083027359943148) internal successors, (70348), 33781 states have internal predecessors, (70348), 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) [2022-02-10 21:58:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33782 states to 33782 states and 70348 transitions. [2022-02-10 21:58:03,593 INFO L78 Accepts]: Start accepts. Automaton has 33782 states and 70348 transitions. Word has length 136 [2022-02-10 21:58:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:58:03,593 INFO L470 AbstractCegarLoop]: Abstraction has 33782 states and 70348 transitions. [2022-02-10 21:58:03,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:58:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 33782 states and 70348 transitions. [2022-02-10 21:58:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:58:03,601 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:58:03,601 INFO L515 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] [2022-02-10 21:58:03,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-10 21:58:03,602 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:58:03,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:58:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1547236965, now seen corresponding path program 19 times [2022-02-10 21:58:03,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:58:03,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074659574] [2022-02-10 21:58:03,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:58:03,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:58:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:58:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:58:05,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:58:05,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074659574] [2022-02-10 21:58:05,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074659574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:58:05,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:58:05,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 21:58:05,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803954803] [2022-02-10 21:58:05,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:58:05,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 21:58:05,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:58:05,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 21:58:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 21:58:05,078 INFO L87 Difference]: Start difference. First operand 33782 states and 70348 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:58:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:58:46,090 INFO L93 Difference]: Finished difference Result 58016 states and 119760 transitions. [2022-02-10 21:58:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-02-10 21:58:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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 136 [2022-02-10 21:58:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:58:46,191 INFO L225 Difference]: With dead ends: 58016 [2022-02-10 21:58:46,191 INFO L226 Difference]: Without dead ends: 58016 [2022-02-10 21:58:46,193 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8649 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=7010, Invalid=23440, Unknown=0, NotChecked=0, Total=30450 [2022-02-10 21:58:46,193 INFO L934 BasicCegarLoop]: 1572 mSDtfsCounter, 8829 mSDsluCounter, 23808 mSDsCounter, 0 mSdLazyCounter, 10254 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8829 SdHoareTripleChecker+Valid, 25358 SdHoareTripleChecker+Invalid, 10505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 10254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:58:46,193 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [8829 Valid, 25358 Invalid, 10505 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [251 Valid, 10254 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-02-10 21:58:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58016 states. [2022-02-10 21:58:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58016 to 35026. [2022-02-10 21:58:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35026 states, 35016 states have (on average 2.08404729266621) internal successors, (72975), 35025 states have internal predecessors, (72975), 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) [2022-02-10 21:58:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35026 states to 35026 states and 72975 transitions. [2022-02-10 21:58:46,861 INFO L78 Accepts]: Start accepts. Automaton has 35026 states and 72975 transitions. Word has length 136 [2022-02-10 21:58:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:58:46,862 INFO L470 AbstractCegarLoop]: Abstraction has 35026 states and 72975 transitions. [2022-02-10 21:58:46,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:58:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 35026 states and 72975 transitions. [2022-02-10 21:58:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:58:46,872 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:58:46,872 INFO L515 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] [2022-02-10 21:58:46,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-10 21:58:46,872 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:58:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:58:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1987148971, now seen corresponding path program 20 times [2022-02-10 21:58:46,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:58:46,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873988004] [2022-02-10 21:58:46,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:58:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:58:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:58:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:58:48,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:58:48,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873988004] [2022-02-10 21:58:48,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873988004] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:58:48,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:58:48,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 21:58:48,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083778886] [2022-02-10 21:58:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:58:48,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 21:58:48,187 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:58:48,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 21:58:48,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1413, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 21:58:48,187 INFO L87 Difference]: Start difference. First operand 35026 states and 72975 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:59:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:59:07,723 INFO L93 Difference]: Finished difference Result 59908 states and 123447 transitions. [2022-02-10 21:59:07,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-10 21:59:07,724 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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 136 [2022-02-10 21:59:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:59:07,817 INFO L225 Difference]: With dead ends: 59908 [2022-02-10 21:59:07,817 INFO L226 Difference]: Without dead ends: 59908 [2022-02-10 21:59:07,818 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4703 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=3113, Invalid=13917, Unknown=0, NotChecked=0, Total=17030 [2022-02-10 21:59:07,818 INFO L934 BasicCegarLoop]: 1287 mSDtfsCounter, 7191 mSDsluCounter, 25966 mSDsCounter, 0 mSdLazyCounter, 10614 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7191 SdHoareTripleChecker+Valid, 27228 SdHoareTripleChecker+Invalid, 10820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 10614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-02-10 21:59:07,819 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7191 Valid, 27228 Invalid, 10820 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 10614 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-02-10 21:59:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59908 states. [2022-02-10 21:59:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59908 to 34697. [2022-02-10 21:59:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34697 states, 34687 states have (on average 2.0836624672067345) internal successors, (72276), 34696 states have internal predecessors, (72276), 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) [2022-02-10 21:59:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34697 states to 34697 states and 72276 transitions. [2022-02-10 21:59:08,483 INFO L78 Accepts]: Start accepts. Automaton has 34697 states and 72276 transitions. Word has length 136 [2022-02-10 21:59:08,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:59:08,483 INFO L470 AbstractCegarLoop]: Abstraction has 34697 states and 72276 transitions. [2022-02-10 21:59:08,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 21:59:08,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34697 states and 72276 transitions. [2022-02-10 21:59:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:59:08,494 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:59:08,494 INFO L515 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] [2022-02-10 21:59:08,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-10 21:59:08,494 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:59:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:59:08,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2072875333, now seen corresponding path program 21 times [2022-02-10 21:59:08,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:59:08,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668935683] [2022-02-10 21:59:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:59:08,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:59:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:59:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:59:09,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:59:09,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668935683] [2022-02-10 21:59:09,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668935683] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:59:09,574 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:59:09,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-02-10 21:59:09,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406021780] [2022-02-10 21:59:09,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:59:09,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-10 21:59:09,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:59:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-10 21:59:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1126, Unknown=0, NotChecked=0, Total=1260 [2022-02-10 21:59:09,575 INFO L87 Difference]: Start difference. First operand 34697 states and 72276 transitions. Second operand has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 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) [2022-02-10 21:59:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:59:25,638 INFO L93 Difference]: Finished difference Result 54029 states and 111450 transitions. [2022-02-10 21:59:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-02-10 21:59:25,639 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 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 136 [2022-02-10 21:59:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:59:25,747 INFO L225 Difference]: With dead ends: 54029 [2022-02-10 21:59:25,747 INFO L226 Difference]: Without dead ends: 54029 [2022-02-10 21:59:25,748 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2803 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=2273, Invalid=9283, Unknown=0, NotChecked=0, Total=11556 [2022-02-10 21:59:25,748 INFO L934 BasicCegarLoop]: 1237 mSDtfsCounter, 7021 mSDsluCounter, 19993 mSDsCounter, 0 mSdLazyCounter, 7791 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7021 SdHoareTripleChecker+Valid, 21209 SdHoareTripleChecker+Invalid, 7993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 7791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-02-10 21:59:25,748 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7021 Valid, 21209 Invalid, 7993 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [202 Valid, 7791 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-02-10 21:59:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54029 states. [2022-02-10 21:59:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54029 to 34426. [2022-02-10 21:59:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34426 states, 34416 states have (on average 2.0832461645746165) internal successors, (71697), 34425 states have internal predecessors, (71697), 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) [2022-02-10 21:59:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34426 states to 34426 states and 71697 transitions. [2022-02-10 21:59:26,378 INFO L78 Accepts]: Start accepts. Automaton has 34426 states and 71697 transitions. Word has length 136 [2022-02-10 21:59:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:59:26,379 INFO L470 AbstractCegarLoop]: Abstraction has 34426 states and 71697 transitions. [2022-02-10 21:59:26,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 36 states have internal predecessors, (136), 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) [2022-02-10 21:59:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 34426 states and 71697 transitions. [2022-02-10 21:59:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:59:26,388 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:59:26,388 INFO L515 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] [2022-02-10 21:59:26,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-10 21:59:26,388 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:59:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:59:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash 104333913, now seen corresponding path program 22 times [2022-02-10 21:59:26,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:59:26,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249230639] [2022-02-10 21:59:26,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:59:26,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:59:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:59:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:59:27,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:59:27,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249230639] [2022-02-10 21:59:27,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249230639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:59:27,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:59:27,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-02-10 21:59:27,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371333789] [2022-02-10 21:59:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:59:27,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 21:59:27,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:59:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 21:59:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2022-02-10 21:59:27,626 INFO L87 Difference]: Start difference. First operand 34426 states and 71697 transitions. Second operand has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:59:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:59:46,332 INFO L93 Difference]: Finished difference Result 57661 states and 118788 transitions. [2022-02-10 21:59:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-02-10 21:59:46,332 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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 136 [2022-02-10 21:59:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:59:46,432 INFO L225 Difference]: With dead ends: 57661 [2022-02-10 21:59:46,432 INFO L226 Difference]: Without dead ends: 57661 [2022-02-10 21:59:46,433 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4010 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=2601, Invalid=12405, Unknown=0, NotChecked=0, Total=15006 [2022-02-10 21:59:46,433 INFO L934 BasicCegarLoop]: 1264 mSDtfsCounter, 6930 mSDsluCounter, 23289 mSDsCounter, 0 mSdLazyCounter, 9757 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6930 SdHoareTripleChecker+Valid, 24530 SdHoareTripleChecker+Invalid, 9956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 9757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-02-10 21:59:46,433 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [6930 Valid, 24530 Invalid, 9956 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [199 Valid, 9757 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-02-10 21:59:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57661 states. [2022-02-10 21:59:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57661 to 32859. [2022-02-10 21:59:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32859 states, 32849 states have (on average 2.081981186641907) internal successors, (68391), 32858 states have internal predecessors, (68391), 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) [2022-02-10 21:59:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32859 states to 32859 states and 68391 transitions. [2022-02-10 21:59:47,169 INFO L78 Accepts]: Start accepts. Automaton has 32859 states and 68391 transitions. Word has length 136 [2022-02-10 21:59:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:59:47,169 INFO L470 AbstractCegarLoop]: Abstraction has 32859 states and 68391 transitions. [2022-02-10 21:59:47,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4871794871794872) internal successors, (136), 39 states have internal predecessors, (136), 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) [2022-02-10 21:59:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 32859 states and 68391 transitions. [2022-02-10 21:59:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 21:59:47,176 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:59:47,177 INFO L515 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] [2022-02-10 21:59:47,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-10 21:59:47,177 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 21:59:47,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:59:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash 948720357, now seen corresponding path program 23 times [2022-02-10 21:59:47,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:59:47,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092058187] [2022-02-10 21:59:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:59:47,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:59:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:59:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:59:48,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:59:48,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092058187] [2022-02-10 21:59:48,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092058187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:59:48,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:59:48,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-02-10 21:59:48,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254580002] [2022-02-10 21:59:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:59:48,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-10 21:59:48,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:59:48,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-10 21:59:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 21:59:48,347 INFO L87 Difference]: Start difference. First operand 32859 states and 68391 transitions. Second operand has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 22:00:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:00:07,933 INFO L93 Difference]: Finished difference Result 51589 states and 106356 transitions. [2022-02-10 22:00:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-02-10 22:00:07,934 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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 136 [2022-02-10 22:00:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:00:08,032 INFO L225 Difference]: With dead ends: 51589 [2022-02-10 22:00:08,033 INFO L226 Difference]: Without dead ends: 51589 [2022-02-10 22:00:08,034 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=2792, Invalid=12958, Unknown=0, NotChecked=0, Total=15750 [2022-02-10 22:00:08,038 INFO L934 BasicCegarLoop]: 1559 mSDtfsCounter, 6887 mSDsluCounter, 26252 mSDsCounter, 0 mSdLazyCounter, 10687 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6887 SdHoareTripleChecker+Valid, 27787 SdHoareTripleChecker+Invalid, 10844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 10687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:00:08,038 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [6887 Valid, 27787 Invalid, 10844 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [157 Valid, 10687 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-02-10 22:00:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51589 states. [2022-02-10 22:00:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51589 to 32907. [2022-02-10 22:00:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32907 states, 32897 states have (on average 2.0819527616499984) internal successors, (68490), 32906 states have internal predecessors, (68490), 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) [2022-02-10 22:00:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32907 states to 32907 states and 68490 transitions. [2022-02-10 22:00:08,802 INFO L78 Accepts]: Start accepts. Automaton has 32907 states and 68490 transitions. Word has length 136 [2022-02-10 22:00:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:00:08,802 INFO L470 AbstractCegarLoop]: Abstraction has 32907 states and 68490 transitions. [2022-02-10 22:00:08,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 22:00:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32907 states and 68490 transitions. [2022-02-10 22:00:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 22:00:08,810 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:00:08,810 INFO L515 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] [2022-02-10 22:00:08,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-10 22:00:08,811 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 22:00:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:00:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1336827763, now seen corresponding path program 24 times [2022-02-10 22:00:08,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:00:08,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784814851] [2022-02-10 22:00:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:00:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:00:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:00:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:00:09,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:00:09,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784814851] [2022-02-10 22:00:09,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784814851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:00:09,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:00:09,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-02-10 22:00:09,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52087541] [2022-02-10 22:00:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:00:09,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-10 22:00:09,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:00:09,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-10 22:00:09,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2022-02-10 22:00:09,867 INFO L87 Difference]: Start difference. First operand 32907 states and 68490 transitions. Second operand has 35 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 35 states have internal predecessors, (136), 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) [2022-02-10 22:00:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:00:27,489 INFO L93 Difference]: Finished difference Result 51328 states and 105825 transitions. [2022-02-10 22:00:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-02-10 22:00:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 35 states have internal predecessors, (136), 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 136 [2022-02-10 22:00:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:00:27,573 INFO L225 Difference]: With dead ends: 51328 [2022-02-10 22:00:27,573 INFO L226 Difference]: Without dead ends: 51328 [2022-02-10 22:00:27,573 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3211 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2408, Invalid=10474, Unknown=0, NotChecked=0, Total=12882 [2022-02-10 22:00:27,574 INFO L934 BasicCegarLoop]: 1498 mSDtfsCounter, 6661 mSDsluCounter, 26709 mSDsCounter, 0 mSdLazyCounter, 10613 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6661 SdHoareTripleChecker+Valid, 28183 SdHoareTripleChecker+Invalid, 10768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 10613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-02-10 22:00:27,574 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [6661 Valid, 28183 Invalid, 10768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [155 Valid, 10613 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-02-10 22:00:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51328 states. [2022-02-10 22:00:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51328 to 32904. [2022-02-10 22:00:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32904 states, 32894 states have (on average 2.0819602359092846) internal successors, (68484), 32903 states have internal predecessors, (68484), 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) [2022-02-10 22:00:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32904 states to 32904 states and 68484 transitions. [2022-02-10 22:00:28,194 INFO L78 Accepts]: Start accepts. Automaton has 32904 states and 68484 transitions. Word has length 136 [2022-02-10 22:00:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:00:28,194 INFO L470 AbstractCegarLoop]: Abstraction has 32904 states and 68484 transitions. [2022-02-10 22:00:28,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.8857142857142857) internal successors, (136), 35 states have internal predecessors, (136), 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) [2022-02-10 22:00:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 32904 states and 68484 transitions. [2022-02-10 22:00:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 22:00:28,202 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:00:28,202 INFO L515 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] [2022-02-10 22:00:28,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-10 22:00:28,202 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 22:00:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:00:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1718368359, now seen corresponding path program 25 times [2022-02-10 22:00:28,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:00:28,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895590872] [2022-02-10 22:00:28,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:00:28,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:00:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:00:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:00:29,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:00:29,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895590872] [2022-02-10 22:00:29,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895590872] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:00:29,417 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:00:29,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 22:00:29,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618885082] [2022-02-10 22:00:29,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:00:29,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 22:00:29,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:00:29,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 22:00:29,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1422, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 22:00:29,418 INFO L87 Difference]: Start difference. First operand 32904 states and 68484 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 22:00:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:00:55,642 INFO L93 Difference]: Finished difference Result 51520 states and 106210 transitions. [2022-02-10 22:00:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-02-10 22:00:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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 136 [2022-02-10 22:00:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:00:55,743 INFO L225 Difference]: With dead ends: 51520 [2022-02-10 22:00:55,743 INFO L226 Difference]: Without dead ends: 51520 [2022-02-10 22:00:55,744 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7184 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=4208, Invalid=19662, Unknown=0, NotChecked=0, Total=23870 [2022-02-10 22:00:55,744 INFO L934 BasicCegarLoop]: 1480 mSDtfsCounter, 7995 mSDsluCounter, 30791 mSDsCounter, 0 mSdLazyCounter, 12688 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7995 SdHoareTripleChecker+Valid, 32242 SdHoareTripleChecker+Invalid, 12910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 12688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-02-10 22:00:55,746 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7995 Valid, 32242 Invalid, 12910 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [222 Valid, 12688 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-02-10 22:00:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51520 states. [2022-02-10 22:00:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51520 to 33013. [2022-02-10 22:00:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33013 states, 33003 states have (on average 2.082083446959367) internal successors, (68715), 33012 states have internal predecessors, (68715), 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) [2022-02-10 22:00:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33013 states to 33013 states and 68715 transitions. [2022-02-10 22:00:56,342 INFO L78 Accepts]: Start accepts. Automaton has 33013 states and 68715 transitions. Word has length 136 [2022-02-10 22:00:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:00:56,342 INFO L470 AbstractCegarLoop]: Abstraction has 33013 states and 68715 transitions. [2022-02-10 22:00:56,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 22:00:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 33013 states and 68715 transitions. [2022-02-10 22:00:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 22:00:56,349 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:00:56,350 INFO L515 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] [2022-02-10 22:00:56,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-10 22:00:56,350 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 22:00:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:00:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash 870591713, now seen corresponding path program 26 times [2022-02-10 22:00:56,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:00:56,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033282717] [2022-02-10 22:00:56,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:00:56,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:00:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:00:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:00:57,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:00:57,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033282717] [2022-02-10 22:00:57,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033282717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:00:57,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:00:57,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-02-10 22:00:57,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515122557] [2022-02-10 22:00:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:00:57,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-10 22:00:57,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:00:57,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-10 22:00:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 22:00:57,368 INFO L87 Difference]: Start difference. First operand 33013 states and 68715 transitions. Second operand has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 22:01:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:01:16,360 INFO L93 Difference]: Finished difference Result 52889 states and 108990 transitions. [2022-02-10 22:01:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-02-10 22:01:16,360 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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 136 [2022-02-10 22:01:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:01:16,462 INFO L225 Difference]: With dead ends: 52889 [2022-02-10 22:01:16,462 INFO L226 Difference]: Without dead ends: 52889 [2022-02-10 22:01:16,463 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3907 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=2857, Invalid=12395, Unknown=0, NotChecked=0, Total=15252 [2022-02-10 22:01:16,463 INFO L934 BasicCegarLoop]: 1429 mSDtfsCounter, 6898 mSDsluCounter, 25117 mSDsCounter, 0 mSdLazyCounter, 9592 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6898 SdHoareTripleChecker+Valid, 26526 SdHoareTripleChecker+Invalid, 9774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 9592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-02-10 22:01:16,464 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [6898 Valid, 26526 Invalid, 9774 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [182 Valid, 9592 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-02-10 22:01:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52889 states. [2022-02-10 22:01:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52889 to 33168. [2022-02-10 22:01:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33168 states, 33158 states have (on average 2.0818505338078293) internal successors, (69030), 33167 states have internal predecessors, (69030), 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) [2022-02-10 22:01:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33168 states to 33168 states and 69030 transitions. [2022-02-10 22:01:17,088 INFO L78 Accepts]: Start accepts. Automaton has 33168 states and 69030 transitions. Word has length 136 [2022-02-10 22:01:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:01:17,089 INFO L470 AbstractCegarLoop]: Abstraction has 33168 states and 69030 transitions. [2022-02-10 22:01:17,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 37 states have internal predecessors, (136), 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) [2022-02-10 22:01:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 33168 states and 69030 transitions. [2022-02-10 22:01:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 22:01:17,097 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:01:17,097 INFO L515 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] [2022-02-10 22:01:17,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-10 22:01:17,097 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 22:01:17,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:01:17,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1247166337, now seen corresponding path program 27 times [2022-02-10 22:01:17,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:01:17,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409895040] [2022-02-10 22:01:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:01:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:01:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:01:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:01:18,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:01:18,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409895040] [2022-02-10 22:01:18,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409895040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:01:18,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:01:18,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 22:01:18,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583436259] [2022-02-10 22:01:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:01:18,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 22:01:18,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:01:18,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 22:01:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1421, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 22:01:18,358 INFO L87 Difference]: Start difference. First operand 33168 states and 69030 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 22:01:42,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:01:42,615 INFO L93 Difference]: Finished difference Result 55496 states and 114276 transitions. [2022-02-10 22:01:42,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-02-10 22:01:42,615 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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 136 [2022-02-10 22:01:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:01:42,737 INFO L225 Difference]: With dead ends: 55496 [2022-02-10 22:01:42,737 INFO L226 Difference]: Without dead ends: 55496 [2022-02-10 22:01:42,738 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=3415, Invalid=16891, Unknown=0, NotChecked=0, Total=20306 [2022-02-10 22:01:42,739 INFO L934 BasicCegarLoop]: 1451 mSDtfsCounter, 7252 mSDsluCounter, 32299 mSDsCounter, 0 mSdLazyCounter, 13834 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7252 SdHoareTripleChecker+Valid, 33719 SdHoareTripleChecker+Invalid, 14018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 13834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-02-10 22:01:42,739 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7252 Valid, 33719 Invalid, 14018 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [184 Valid, 13834 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-02-10 22:01:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55496 states. [2022-02-10 22:01:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55496 to 33033. [2022-02-10 22:01:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33033 states, 33023 states have (on average 2.0820640159888564) internal successors, (68756), 33032 states have internal predecessors, (68756), 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) [2022-02-10 22:01:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33033 states to 33033 states and 68756 transitions. [2022-02-10 22:01:43,514 INFO L78 Accepts]: Start accepts. Automaton has 33033 states and 68756 transitions. Word has length 136 [2022-02-10 22:01:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:01:43,514 INFO L470 AbstractCegarLoop]: Abstraction has 33033 states and 68756 transitions. [2022-02-10 22:01:43,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 22:01:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 33033 states and 68756 transitions. [2022-02-10 22:01:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 22:01:43,522 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:01:43,522 INFO L515 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] [2022-02-10 22:01:43,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-10 22:01:43,523 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 22:01:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:01:43,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1942044809, now seen corresponding path program 28 times [2022-02-10 22:01:43,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:01:43,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065462450] [2022-02-10 22:01:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:01:43,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:01:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:01:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:01:44,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:01:44,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065462450] [2022-02-10 22:01:44,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065462450] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:01:44,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:01:44,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 22:01:44,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440424724] [2022-02-10 22:01:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:01:44,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 22:01:44,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:01:44,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 22:01:44,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 22:01:44,832 INFO L87 Difference]: Start difference. First operand 33033 states and 68756 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 22:02:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:02:13,094 INFO L93 Difference]: Finished difference Result 55713 states and 114829 transitions. [2022-02-10 22:02:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-02-10 22:02:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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 136 [2022-02-10 22:02:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:02:13,205 INFO L225 Difference]: With dead ends: 55713 [2022-02-10 22:02:13,205 INFO L226 Difference]: Without dead ends: 55713 [2022-02-10 22:02:13,206 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6100 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=3825, Invalid=17931, Unknown=0, NotChecked=0, Total=21756 [2022-02-10 22:02:13,207 INFO L934 BasicCegarLoop]: 1493 mSDtfsCounter, 7604 mSDsluCounter, 30421 mSDsCounter, 0 mSdLazyCounter, 12614 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7604 SdHoareTripleChecker+Valid, 31889 SdHoareTripleChecker+Invalid, 12803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 12614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:02:13,207 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7604 Valid, 31889 Invalid, 12803 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [189 Valid, 12614 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-02-10 22:02:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55713 states. [2022-02-10 22:02:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55713 to 33610. [2022-02-10 22:02:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33610 states, 33600 states have (on average 2.082261904761905) internal successors, (69964), 33609 states have internal predecessors, (69964), 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) [2022-02-10 22:02:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33610 states to 33610 states and 69964 transitions. [2022-02-10 22:02:14,077 INFO L78 Accepts]: Start accepts. Automaton has 33610 states and 69964 transitions. Word has length 136 [2022-02-10 22:02:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:02:14,078 INFO L470 AbstractCegarLoop]: Abstraction has 33610 states and 69964 transitions. [2022-02-10 22:02:14,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) [2022-02-10 22:02:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 33610 states and 69964 transitions. [2022-02-10 22:02:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 22:02:14,088 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:02:14,088 INFO L515 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] [2022-02-10 22:02:14,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-10 22:02:14,088 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 22:02:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:02:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash -175713241, now seen corresponding path program 29 times [2022-02-10 22:02:14,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:02:14,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822616434] [2022-02-10 22:02:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:02:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:02:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:02:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:02:15,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:02:15,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822616434] [2022-02-10 22:02:15,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822616434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:02:15,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:02:15,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-02-10 22:02:15,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255327454] [2022-02-10 22:02:15,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:02:15,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-10 22:02:15,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:02:15,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-10 22:02:15,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2022-02-10 22:02:15,570 INFO L87 Difference]: Start difference. First operand 33610 states and 69964 transitions. Second operand has 44 states, 44 states have (on average 3.090909090909091) internal successors, (136), 44 states have internal predecessors, (136), 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) [2022-02-10 22:02:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:02:37,704 INFO L93 Difference]: Finished difference Result 56987 states and 117492 transitions. [2022-02-10 22:02:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-02-10 22:02:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.090909090909091) internal successors, (136), 44 states have internal predecessors, (136), 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 136 [2022-02-10 22:02:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:02:37,824 INFO L225 Difference]: With dead ends: 56987 [2022-02-10 22:02:37,824 INFO L226 Difference]: Without dead ends: 56987 [2022-02-10 22:02:37,825 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5053 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=3480, Invalid=15702, Unknown=0, NotChecked=0, Total=19182 [2022-02-10 22:02:37,825 INFO L934 BasicCegarLoop]: 1402 mSDtfsCounter, 7997 mSDsluCounter, 24996 mSDsCounter, 0 mSdLazyCounter, 10673 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7997 SdHoareTripleChecker+Valid, 26376 SdHoareTripleChecker+Invalid, 10894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 10673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-02-10 22:02:37,826 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7997 Valid, 26376 Invalid, 10894 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [221 Valid, 10673 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-02-10 22:02:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56987 states. [2022-02-10 22:02:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56987 to 33233. [2022-02-10 22:02:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33233 states, 33223 states have (on average 2.0824729855822772) internal successors, (69186), 33232 states have internal predecessors, (69186), 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) [2022-02-10 22:02:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33233 states to 33233 states and 69186 transitions. [2022-02-10 22:02:38,623 INFO L78 Accepts]: Start accepts. Automaton has 33233 states and 69186 transitions. Word has length 136 [2022-02-10 22:02:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:02:38,623 INFO L470 AbstractCegarLoop]: Abstraction has 33233 states and 69186 transitions. [2022-02-10 22:02:38,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.090909090909091) internal successors, (136), 44 states have internal predecessors, (136), 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) [2022-02-10 22:02:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 33233 states and 69186 transitions. [2022-02-10 22:02:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-10 22:02:38,632 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:02:38,632 INFO L515 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] [2022-02-10 22:02:38,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-10 22:02:38,633 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2022-02-10 22:02:38,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:02:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash 694031945, now seen corresponding path program 30 times [2022-02-10 22:02:38,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:02:38,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937554750] [2022-02-10 22:02:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:02:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:02:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:02:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:02:40,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:02:40,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937554750] [2022-02-10 22:02:40,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937554750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:02:40,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:02:40,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-02-10 22:02:40,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484912519] [2022-02-10 22:02:40,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:02:40,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-10 22:02:40,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:02:40,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-10 22:02:40,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1412, Unknown=0, NotChecked=0, Total=1560 [2022-02-10 22:02:40,128 INFO L87 Difference]: Start difference. First operand 33233 states and 69186 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 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) Received shutdown request... [2022-02-10 22:02:53,539 WARN L244 SmtUtils]: Removed 15 from assertion stack [2022-02-10 22:02:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-02-10 22:02:53,540 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2181 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2091, Invalid=7611, Unknown=0, NotChecked=0, Total=9702 [2022-02-10 22:02:53,540 INFO L934 BasicCegarLoop]: 249 mSDtfsCounter, 2308 mSDsluCounter, 3300 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2308 SdHoareTripleChecker+Valid, 3549 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:02:53,540 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2308 Valid, 3549 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-10 22:02:53,541 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2022-02-10 22:02:53,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-10 22:02:53,542 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. [2022-02-10 22:02:53,543 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 12 remaining) [2022-02-10 22:02:53,543 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 12 remaining) [2022-02-10 22:02:53,543 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2022-02-10 22:02:53,543 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 12 remaining) [2022-02-10 22:02:53,543 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 12 remaining) [2022-02-10 22:02:53,543 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 12 remaining) [2022-02-10 22:02:53,543 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2022-02-10 22:02:53,543 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2022-02-10 22:02:53,544 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (2 of 12 remaining) [2022-02-10 22:02:53,544 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2022-02-10 22:02:53,544 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 12 remaining) [2022-02-10 22:02:53,547 INFO L733 BasicCegarLoop]: Path program histogram: [30, 1, 1, 1, 1, 1, 1] [2022-02-10 22:02:53,549 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 22:02:53,549 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 22:02:53,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 10:02:53 BasicIcfg [2022-02-10 22:02:53,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 22:02:53,553 INFO L158 Benchmark]: Toolchain (without parser) took 721711.48ms. Allocated memory was 199.2MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 141.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-02-10 22:02:53,554 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 22:02:53,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.89ms. Allocated memory was 199.2MB in the beginning and 321.9MB in the end (delta: 122.7MB). Free memory was 141.6MB in the beginning and 273.4MB in the end (delta: -131.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-02-10 22:02:53,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.50ms. Allocated memory is still 321.9MB. Free memory was 273.4MB in the beginning and 269.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-02-10 22:02:53,558 INFO L158 Benchmark]: Boogie Preprocessor took 66.42ms. Allocated memory is still 321.9MB. Free memory was 269.3MB in the beginning and 265.6MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 22:02:53,560 INFO L158 Benchmark]: RCFGBuilder took 524.38ms. Allocated memory is still 321.9MB. Free memory was 265.6MB in the beginning and 230.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-02-10 22:02:53,560 INFO L158 Benchmark]: TraceAbstraction took 720454.23ms. Allocated memory was 321.9MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 229.4MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-02-10 22:02:53,561 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.12ms. Allocated memory is still 199.2MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 581.89ms. Allocated memory was 199.2MB in the beginning and 321.9MB in the end (delta: 122.7MB). Free memory was 141.6MB in the beginning and 273.4MB in the end (delta: -131.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.50ms. Allocated memory is still 321.9MB. Free memory was 273.4MB in the beginning and 269.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.42ms. Allocated memory is still 321.9MB. Free memory was 269.3MB in the beginning and 265.6MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 524.38ms. Allocated memory is still 321.9MB. Free memory was 265.6MB in the beginning and 230.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 720454.23ms. Allocated memory was 321.9MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 229.4MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1016]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1098]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1076]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1096]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1054]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - TimeoutResultAtElement [Line: 1092]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (33233states) and FLOYD_HOARE automaton (currently 63 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 238 for 158ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 537 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 720.3s, OverallIterations: 36, TraceHistogramMax: 1, PathProgramHistogramMax: 30, EmptinessCheckTime: 0.3s, AutomataDifference: 658.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265710 SdHoareTripleChecker+Valid, 146.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 265710 mSDsluCounter, 791456 SdHoareTripleChecker+Invalid, 124.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 749511 mSDsCounter, 7459 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312442 IncrementalHoareTripleChecker+Invalid, 319901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7459 mSolverCounterUnsat, 42715 mSDtfsCounter, 312442 mSolverCounterSat, 2.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4342 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 4159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163146 ImplicationChecksByTransitivity, 507.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35026occurred in iteration=25, InterpolantAutomatonStates: 3088, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 804526 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 38.2s InterpolantComputationTime, 4653 NumberOfCodeBlocks, 4653 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4617 ConstructedInterpolants, 0 QuantifiedInterpolants, 122922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown