./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ba4618d2c12b624306627073ace8aff518621333cf7d938808dd7313f83bbaa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:20:39,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:20:39,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:20:39,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:20:39,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:20:39,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:20:39,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:20:39,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:20:39,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:20:39,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:20:39,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:20:39,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:20:39,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:20:39,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:20:39,720 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:20:39,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:20:39,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:20:39,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:20:39,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:20:39,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:20:39,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:20:39,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:20:39,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:20:39,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:20:39,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:20:39,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:20:39,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:20:39,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:20:39,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:20:39,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:20:39,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:20:39,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:20:39,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:20:39,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:20:39,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:20:39,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:20:39,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:20:39,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:20:39,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:20:39,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:20:39,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:20:39,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:20:39,735 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ba4618d2c12b624306627073ace8aff518621333cf7d938808dd7313f83bbaa [2024-10-13 06:20:40,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:20:40,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:20:40,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:20:40,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:20:40,059 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:20:40,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i [2024-10-13 06:20:41,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:20:41,882 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:20:41,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i [2024-10-13 06:20:41,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e3e9bc9/87d71ccc19d24be08f60a342095e1b68/FLAGd80df08ca [2024-10-13 06:20:41,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e3e9bc9/87d71ccc19d24be08f60a342095e1b68 [2024-10-13 06:20:41,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:20:41,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:20:41,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:20:41,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:20:41,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:20:41,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:20:41" (1/1) ... [2024-10-13 06:20:41,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4314c7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:41, skipping insertion in model container [2024-10-13 06:20:41,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:20:41" (1/1) ... [2024-10-13 06:20:41,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:20:42,147 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i[916,929] [2024-10-13 06:20:42,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:20:42,221 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:20:42,233 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i[916,929] [2024-10-13 06:20:42,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:20:42,296 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:20:42,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42 WrapperNode [2024-10-13 06:20:42,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:20:42,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:20:42,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:20:42,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:20:42,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,369 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2024-10-13 06:20:42,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:20:42,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:20:42,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:20:42,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:20:42,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,423 INFO L175 MemorySlicer]: Split 131 memory accesses to 16 slices as follows [2, 15, 6, 10, 11, 8, 8, 8, 10, 7, 6, 8, 3, 12, 7, 10]. 11 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1]. [2024-10-13 06:20:42,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:20:42,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:20:42,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:20:42,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:20:42,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (1/1) ... [2024-10-13 06:20:42,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:20:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:20:42,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:20:42,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:20:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:20:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:20:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:20:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:20:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:20:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:20:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:20:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 06:20:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 06:20:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 06:20:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 06:20:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 06:20:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-13 06:20:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-13 06:20:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-13 06:20:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-13 06:20:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-13 06:20:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:20:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:20:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 06:20:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 06:20:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 06:20:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 06:20:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-13 06:20:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-13 06:20:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-13 06:20:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-13 06:20:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-13 06:20:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-13 06:20:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-13 06:20:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-13 06:20:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-13 06:20:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-13 06:20:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:20:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:20:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 06:20:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 06:20:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 06:20:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 06:20:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-13 06:20:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-13 06:20:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-13 06:20:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-13 06:20:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-13 06:20:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-13 06:20:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-13 06:20:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-13 06:20:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-13 06:20:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-13 06:20:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:20:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:20:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:20:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:20:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:20:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:20:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 06:20:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 06:20:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:20:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-13 06:20:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-13 06:20:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-13 06:20:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-13 06:20:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-13 06:20:42,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:20:42,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:20:42,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:20:42,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:20:42,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:20:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:20:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:20:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:20:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 06:20:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 06:20:42,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 06:20:42,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 06:20:42,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 06:20:42,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-13 06:20:42,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-13 06:20:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-13 06:20:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-13 06:20:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-13 06:20:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:20:42,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:20:42,830 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:20:42,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:20:43,637 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-10-13 06:20:43,637 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:20:43,690 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:20:43,691 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:20:43,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:20:43 BoogieIcfgContainer [2024-10-13 06:20:43,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:20:43,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:20:43,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:20:43,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:20:43,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:20:41" (1/3) ... [2024-10-13 06:20:43,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3427d779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:20:43, skipping insertion in model container [2024-10-13 06:20:43,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:20:42" (2/3) ... [2024-10-13 06:20:43,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3427d779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:20:43, skipping insertion in model container [2024-10-13 06:20:43,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:20:43" (3/3) ... [2024-10-13 06:20:43,705 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-64.i [2024-10-13 06:20:43,721 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:20:43,722 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:20:43,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:20:43,811 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7647c4a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:20:43,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:20:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:20:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:20:43,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:43,839 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:43,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:43,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 938953730, now seen corresponding path program 1 times [2024-10-13 06:20:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:43,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440804803] [2024-10-13 06:20:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:20:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:20:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:20:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:20:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:20:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:20:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:20:44,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:44,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440804803] [2024-10-13 06:20:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440804803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:44,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:44,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:20:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257527124] [2024-10-13 06:20:44,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:44,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:20:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:44,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:20:44,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:20:44,490 INFO L87 Difference]: Start difference. First operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:20:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:44,550 INFO L93 Difference]: Finished difference Result 241 states and 388 transitions. [2024-10-13 06:20:44,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:20:44,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2024-10-13 06:20:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:44,563 INFO L225 Difference]: With dead ends: 241 [2024-10-13 06:20:44,563 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 06:20:44,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:20:44,574 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:44,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:20:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 06:20:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-13 06:20:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:20:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 180 transitions. [2024-10-13 06:20:44,628 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 180 transitions. Word has length 154 [2024-10-13 06:20:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:44,629 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 180 transitions. [2024-10-13 06:20:44,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:20:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 180 transitions. [2024-10-13 06:20:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:20:44,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:44,634 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:44,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:20:44,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 405407330, now seen corresponding path program 1 times [2024-10-13 06:20:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722238773] [2024-10-13 06:20:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:20:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:20:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:20:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:44,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:20:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:20:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:20:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:20:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722238773] [2024-10-13 06:20:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722238773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:45,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:20:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345876280] [2024-10-13 06:20:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:45,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:20:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:45,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:20:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:20:45,070 INFO L87 Difference]: Start difference. First operand 120 states and 180 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:20:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:45,137 INFO L93 Difference]: Finished difference Result 241 states and 362 transitions. [2024-10-13 06:20:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:20:45,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2024-10-13 06:20:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:45,143 INFO L225 Difference]: With dead ends: 241 [2024-10-13 06:20:45,146 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 06:20:45,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:20:45,148 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:45,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:20:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 06:20:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-13 06:20:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:20:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-10-13 06:20:45,163 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 154 [2024-10-13 06:20:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:45,167 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-10-13 06:20:45,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:20:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-10-13 06:20:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:20:45,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:45,172 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:45,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:20:45,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:45,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:45,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1712549728, now seen corresponding path program 1 times [2024-10-13 06:20:45,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:45,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84635408] [2024-10-13 06:20:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:45,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:20:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:20:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:20:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:20:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:20:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:20:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:20:45,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:45,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84635408] [2024-10-13 06:20:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84635408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:45,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:45,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:20:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559334237] [2024-10-13 06:20:45,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:45,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:20:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:45,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:20:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:20:45,646 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:20:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:45,704 INFO L93 Difference]: Finished difference Result 245 states and 366 transitions. [2024-10-13 06:20:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:20:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-10-13 06:20:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:45,707 INFO L225 Difference]: With dead ends: 245 [2024-10-13 06:20:45,707 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 06:20:45,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:20:45,711 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:45,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:20:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 06:20:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-13 06:20:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:20:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-10-13 06:20:45,730 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 154 [2024-10-13 06:20:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:45,731 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-10-13 06:20:45,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:20:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-10-13 06:20:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 06:20:45,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:45,735 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:45,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:20:45,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:45,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash -661838834, now seen corresponding path program 1 times [2024-10-13 06:20:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:45,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908494545] [2024-10-13 06:20:45,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:45,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:20:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:20:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:20:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:20:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:20:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:20:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:20:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908494545] [2024-10-13 06:20:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908494545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:46,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:46,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:20:46,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555499846] [2024-10-13 06:20:46,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:46,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:20:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:46,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:20:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:20:46,139 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:20:46,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:46,190 INFO L93 Difference]: Finished difference Result 250 states and 371 transitions. [2024-10-13 06:20:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:20:46,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-10-13 06:20:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:46,197 INFO L225 Difference]: With dead ends: 250 [2024-10-13 06:20:46,197 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 06:20:46,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:20:46,199 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:46,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 681 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:20:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 06:20:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-13 06:20:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:20:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 187 transitions. [2024-10-13 06:20:46,213 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 187 transitions. Word has length 156 [2024-10-13 06:20:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:46,214 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 187 transitions. [2024-10-13 06:20:46,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:20:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2024-10-13 06:20:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:20:46,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:46,217 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:46,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:20:46,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:46,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash -491697587, now seen corresponding path program 1 times [2024-10-13 06:20:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:46,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891586561] [2024-10-13 06:20:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:20:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:20:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:20:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:20:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:20:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:20:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:20:47,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:47,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891586561] [2024-10-13 06:20:47,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891586561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:47,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:47,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:20:47,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167173032] [2024-10-13 06:20:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:47,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:20:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:20:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:20:47,221 INFO L87 Difference]: Start difference. First operand 127 states and 187 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:20:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:47,685 INFO L93 Difference]: Finished difference Result 478 states and 700 transitions. [2024-10-13 06:20:47,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:20:47,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-13 06:20:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:47,689 INFO L225 Difference]: With dead ends: 478 [2024-10-13 06:20:47,690 INFO L226 Difference]: Without dead ends: 352 [2024-10-13 06:20:47,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:20:47,693 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 378 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:47,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 848 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:20:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-13 06:20:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 144. [2024-10-13 06:20:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.4180327868852458) internal successors, (173), 122 states have internal predecessors, (173), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:20:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2024-10-13 06:20:47,718 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 157 [2024-10-13 06:20:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:47,719 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2024-10-13 06:20:47,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:20:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2024-10-13 06:20:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 06:20:47,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:47,721 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:47,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:20:47,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:47,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash -786118807, now seen corresponding path program 1 times [2024-10-13 06:20:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:47,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090969720] [2024-10-13 06:20:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:20:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:20:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:20:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:20:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:20:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:20:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 06:20:48,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090969720] [2024-10-13 06:20:48,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090969720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:20:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981240671] [2024-10-13 06:20:48,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:48,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:20:48,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:20:48,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:20:48,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:20:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:49,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 06:20:49,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:20:49,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:49,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:20:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 17 proven. 195 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-13 06:20:49,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:20:50,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981240671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:20:50,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:20:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-10-13 06:20:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613377386] [2024-10-13 06:20:50,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:20:50,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:20:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:20:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:20:50,500 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 14 states, 12 states have (on average 9.583333333333334) internal successors, (115), 13 states have internal predecessors, (115), 6 states have call successors, (40), 3 states have call predecessors, (40), 4 states have return successors, (40), 5 states have call predecessors, (40), 6 states have call successors, (40) [2024-10-13 06:20:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:51,740 INFO L93 Difference]: Finished difference Result 422 states and 618 transitions. [2024-10-13 06:20:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 06:20:51,742 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.583333333333334) internal successors, (115), 13 states have internal predecessors, (115), 6 states have call successors, (40), 3 states have call predecessors, (40), 4 states have return successors, (40), 5 states have call predecessors, (40), 6 states have call successors, (40) Word has length 158 [2024-10-13 06:20:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:51,744 INFO L225 Difference]: With dead ends: 422 [2024-10-13 06:20:51,744 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 06:20:51,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 06:20:51,747 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 681 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:51,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1234 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:20:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 06:20:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 129. [2024-10-13 06:20:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:20:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2024-10-13 06:20:51,777 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 158 [2024-10-13 06:20:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:51,778 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2024-10-13 06:20:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.583333333333334) internal successors, (115), 13 states have internal predecessors, (115), 6 states have call successors, (40), 3 states have call predecessors, (40), 4 states have return successors, (40), 5 states have call predecessors, (40), 6 states have call successors, (40) [2024-10-13 06:20:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2024-10-13 06:20:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 06:20:51,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:51,782 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:51,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:20:51,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 06:20:51,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:51,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1568549287, now seen corresponding path program 1 times [2024-10-13 06:20:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:51,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505748290] [2024-10-13 06:20:51,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:20:52,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74904376] [2024-10-13 06:20:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:52,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:20:52,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:20:52,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:20:52,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 06:20:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:52,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 06:20:52,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:20:53,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 13 proven. 375 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-13 06:20:53,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:20:54,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-10-13 06:20:54,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505748290] [2024-10-13 06:20:54,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:20:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74904376] [2024-10-13 06:20:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74904376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:20:54,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:20:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-13 06:20:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475212677] [2024-10-13 06:20:54,533 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 06:20:54,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:20:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:54,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:20:54,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:20:54,535 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:20:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:55,169 INFO L93 Difference]: Finished difference Result 394 states and 564 transitions. [2024-10-13 06:20:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:20:55,170 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2024-10-13 06:20:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:55,172 INFO L225 Difference]: With dead ends: 394 [2024-10-13 06:20:55,172 INFO L226 Difference]: Without dead ends: 266 [2024-10-13 06:20:55,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2024-10-13 06:20:55,174 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 314 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:55,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1252 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:20:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-13 06:20:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 206. [2024-10-13 06:20:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.325) internal successors, (212), 160 states have internal predecessors, (212), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 06:20:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 292 transitions. [2024-10-13 06:20:55,208 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 292 transitions. Word has length 159 [2024-10-13 06:20:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:55,208 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 292 transitions. [2024-10-13 06:20:55,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:20:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 292 transitions. [2024-10-13 06:20:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 06:20:55,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:55,211 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:55,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:20:55,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-13 06:20:55,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:55,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1434535781, now seen corresponding path program 1 times [2024-10-13 06:20:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433413167] [2024-10-13 06:20:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat