./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-a_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-a_file-36.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 41f77efcfe33be11618a361f7eb55ba9d9569bca80921eb0046d4538ba494080 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:15:41,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:15:41,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:15:41,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:15:41,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:15:41,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:15:41,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:15:41,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:15:41,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:15:41,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:15:41,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:15:41,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:15:41,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:15:41,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:15:41,594 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:15:41,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:15:41,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:15:41,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:15:41,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:15:41,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:15:41,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:15:41,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:15:41,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:15:41,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:15:41,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:15:41,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:15:41,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:15:41,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:15:41,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:15:41,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:15:41,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:15:41,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:15:41,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:15:41,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:15:41,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:15:41,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:15:41,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:15:41,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:15:41,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:15:41,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:15:41,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:15:41,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:15:41,609 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 -> 41f77efcfe33be11618a361f7eb55ba9d9569bca80921eb0046d4538ba494080 [2024-10-24 11:15:41,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:15:41,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:15:41,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:15:41,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:15:41,928 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:15:41,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i [2024-10-24 11:15:43,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:15:43,571 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:15:43,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i [2024-10-24 11:15:43,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be10dec34/4933a1077149450f8f89fcc5b07f9888/FLAG2f6c1e5ae [2024-10-24 11:15:43,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be10dec34/4933a1077149450f8f89fcc5b07f9888 [2024-10-24 11:15:43,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:15:43,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:15:43,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:15:43,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:15:43,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:15:43,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:15:43" (1/1) ... [2024-10-24 11:15:43,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6214e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:43, skipping insertion in model container [2024-10-24 11:15:43,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:15:43" (1/1) ... [2024-10-24 11:15:43,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:15:44,127 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-a_file-36.i[916,929] [2024-10-24 11:15:44,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:15:44,242 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:15:44,256 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-a_file-36.i[916,929] [2024-10-24 11:15:44,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:15:44,322 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:15:44,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44 WrapperNode [2024-10-24 11:15:44,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:15:44,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:15:44,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:15:44,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:15:44,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,402 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2024-10-24 11:15:44,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:15:44,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:15:44,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:15:44,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:15:44,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,468 INFO L175 MemorySlicer]: Split 133 memory accesses to 6 slices as follows [2, 23, 61, 16, 22, 9]. 46 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 4, 2, 2, 1]. The 18 writes are split as follows [0, 3, 5, 2, 4, 4]. [2024-10-24 11:15:44,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:15:44,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:15:44,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:15:44,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:15:44,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (1/1) ... [2024-10-24 11:15:44,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:15:44,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:15:44,572 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-24 11:15:44,576 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-24 11:15:44,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:15:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:15:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:15:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:15:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:15:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:15:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:15:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:15:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:15:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:15:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:15:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:15:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:15:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:15:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:15:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:15:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:15:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:15:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:15:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:15:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:15:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:15:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:15:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:15:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:15:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:15:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:15:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:15:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:15:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:15:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:15:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:15:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:15:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:15:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:15:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:15:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:15:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:15:44,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:15:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:15:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:15:44,757 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:15:44,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:15:45,265 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-24 11:15:45,265 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:15:45,309 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:15:45,310 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:15:45,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:15:45 BoogieIcfgContainer [2024-10-24 11:15:45,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:15:45,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:15:45,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:15:45,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:15:45,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:15:43" (1/3) ... [2024-10-24 11:15:45,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbea31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:15:45, skipping insertion in model container [2024-10-24 11:15:45,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:44" (2/3) ... [2024-10-24 11:15:45,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbea31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:15:45, skipping insertion in model container [2024-10-24 11:15:45,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:15:45" (3/3) ... [2024-10-24 11:15:45,319 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-36.i [2024-10-24 11:15:45,336 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:15:45,336 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:15:45,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:15:45,411 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;@4eb80494, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:15:45,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:15:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 103 states have internal predecessors, (155), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:15:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:15:45,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:45,425 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:45,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:45,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash -907058151, now seen corresponding path program 1 times [2024-10-24 11:15:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:45,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564741508] [2024-10-24 11:15:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:15:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:15:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:15:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:45,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564741508] [2024-10-24 11:15:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564741508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:15:45,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128204832] [2024-10-24 11:15:45,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:45,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:15:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:15:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:15:45,922 INFO L87 Difference]: Start difference. First operand has 116 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 103 states have internal predecessors, (155), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:15:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:45,980 INFO L93 Difference]: Finished difference Result 229 states and 363 transitions. [2024-10-24 11:15:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:15:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-24 11:15:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:45,996 INFO L225 Difference]: With dead ends: 229 [2024-10-24 11:15:45,996 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 11:15:46,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-24 11:15:46,005 INFO L432 NwaCegarLoop]: 168 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, 168 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-24 11:15:46,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 11:15:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-24 11:15:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.4851485148514851) internal successors, (150), 101 states have internal predecessors, (150), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:15:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2024-10-24 11:15:46,063 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 104 [2024-10-24 11:15:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:46,064 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2024-10-24 11:15:46,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:15:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2024-10-24 11:15:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:15:46,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:46,073 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:15:46,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:46,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1500136681, now seen corresponding path program 1 times [2024-10-24 11:15:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:46,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538107795] [2024-10-24 11:15:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:46,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:15:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:15:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:15:46,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:46,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538107795] [2024-10-24 11:15:46,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538107795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:46,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:46,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:46,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755038172] [2024-10-24 11:15:46,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:46,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:46,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:46,428 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:15:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:46,502 INFO L93 Difference]: Finished difference Result 229 states and 346 transitions. [2024-10-24 11:15:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:46,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-24 11:15:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:46,505 INFO L225 Difference]: With dead ends: 229 [2024-10-24 11:15:46,507 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:15:46,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-24 11:15:46,509 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 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-24 11:15:46,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:15:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 11:15:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:15:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2024-10-24 11:15:46,533 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 104 [2024-10-24 11:15:46,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:46,535 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2024-10-24 11:15:46,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:15:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2024-10-24 11:15:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:15:46,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:46,537 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:46,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:15:46,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:46,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1701960615, now seen corresponding path program 1 times [2024-10-24 11:15:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676228662] [2024-10-24 11:15:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:15:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:15:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:15:47,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:47,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676228662] [2024-10-24 11:15:47,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676228662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:47,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689915986] [2024-10-24 11:15:47,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:47,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:47,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:47,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:47,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:47,130 INFO L87 Difference]: Start difference. First operand 116 states and 174 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:47,261 INFO L93 Difference]: Finished difference Result 347 states and 522 transitions. [2024-10-24 11:15:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:47,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-24 11:15:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:47,264 INFO L225 Difference]: With dead ends: 347 [2024-10-24 11:15:47,266 INFO L226 Difference]: Without dead ends: 232 [2024-10-24 11:15:47,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:15:47,268 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 126 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:47,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 450 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-24 11:15:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2024-10-24 11:15:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.477832512315271) internal successors, (300), 203 states have internal predecessors, (300), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:15:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 344 transitions. [2024-10-24 11:15:47,305 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 344 transitions. Word has length 104 [2024-10-24 11:15:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:47,306 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 344 transitions. [2024-10-24 11:15:47,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 344 transitions. [2024-10-24 11:15:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:15:47,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:47,312 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:47,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:15:47,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:47,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1581889431, now seen corresponding path program 1 times [2024-10-24 11:15:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:47,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817527405] [2024-10-24 11:15:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:15:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:15:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:15:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817527405] [2024-10-24 11:15:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817527405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42091318] [2024-10-24 11:15:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:47,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:47,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:47,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:47,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:47,716 INFO L87 Difference]: Start difference. First operand 228 states and 344 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:47,813 INFO L93 Difference]: Finished difference Result 460 states and 693 transitions. [2024-10-24 11:15:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-24 11:15:47,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:47,817 INFO L225 Difference]: With dead ends: 460 [2024-10-24 11:15:47,817 INFO L226 Difference]: Without dead ends: 233 [2024-10-24 11:15:47,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:15:47,822 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 123 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:47,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 451 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-24 11:15:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2024-10-24 11:15:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 204 states have (on average 1.4754901960784315) internal successors, (301), 204 states have internal predecessors, (301), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:15:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 345 transitions. [2024-10-24 11:15:47,849 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 345 transitions. Word has length 104 [2024-10-24 11:15:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:47,851 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 345 transitions. [2024-10-24 11:15:47,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 345 transitions. [2024-10-24 11:15:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:15:47,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:47,853 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:47,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:15:47,853 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:47,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:47,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2012013287, now seen corresponding path program 1 times [2024-10-24 11:15:47,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:47,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137034441] [2024-10-24 11:15:47,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:47,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:15:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:15:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:15:48,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137034441] [2024-10-24 11:15:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137034441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:48,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:48,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:48,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477682476] [2024-10-24 11:15:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:48,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:48,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:48,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:48,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:48,091 INFO L87 Difference]: Start difference. First operand 229 states and 345 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:48,240 INFO L93 Difference]: Finished difference Result 630 states and 951 transitions. [2024-10-24 11:15:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:48,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-24 11:15:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:48,243 INFO L225 Difference]: With dead ends: 630 [2024-10-24 11:15:48,243 INFO L226 Difference]: Without dead ends: 402 [2024-10-24 11:15:48,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:15:48,246 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 185 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:48,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 463 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-24 11:15:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 350. [2024-10-24 11:15:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 313 states have (on average 1.4792332268370607) internal successors, (463), 313 states have internal predecessors, (463), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 11:15:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 529 transitions. [2024-10-24 11:15:48,286 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 529 transitions. Word has length 104 [2024-10-24 11:15:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:48,287 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 529 transitions. [2024-10-24 11:15:48,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 529 transitions. [2024-10-24 11:15:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:15:48,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:48,290 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:48,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:15:48,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:48,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash -625501472, now seen corresponding path program 1 times [2024-10-24 11:15:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713255974] [2024-10-24 11:15:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:15:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:15:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:15:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713255974] [2024-10-24 11:15:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713255974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:15:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569608761] [2024-10-24 11:15:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:48,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:15:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:48,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:15:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:15:48,778 INFO L87 Difference]: Start difference. First operand 350 states and 529 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:48,922 INFO L93 Difference]: Finished difference Result 810 states and 1219 transitions. [2024-10-24 11:15:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:15:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:15:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:48,928 INFO L225 Difference]: With dead ends: 810 [2024-10-24 11:15:48,928 INFO L226 Difference]: Without dead ends: 582 [2024-10-24 11:15:48,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:15:48,930 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 144 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:48,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 699 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-10-24 11:15:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 370. [2024-10-24 11:15:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 333 states have (on average 1.4744744744744744) internal successors, (491), 333 states have internal predecessors, (491), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 11:15:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 557 transitions. [2024-10-24 11:15:48,962 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 557 transitions. Word has length 105 [2024-10-24 11:15:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:48,963 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 557 transitions. [2024-10-24 11:15:48,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 557 transitions. [2024-10-24 11:15:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:15:48,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:48,965 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:48,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:15:48,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:48,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1805104244, now seen corresponding path program 1 times [2024-10-24 11:15:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:48,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160916635] [2024-10-24 11:15:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:15:49,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:15:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:15:49,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:15:49,114 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:15:49,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:15:49,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:15:49,120 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:49,223 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:15:49,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:15:49 BoogieIcfgContainer [2024-10-24 11:15:49,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:15:49,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:15:49,228 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:15:49,228 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:15:49,228 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:15:45" (3/4) ... [2024-10-24 11:15:49,230 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:15:49,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:15:49,232 INFO L158 Benchmark]: Toolchain (without parser) took 5293.57ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 88.3MB in the beginning and 79.5MB in the end (delta: 8.7MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2024-10-24 11:15:49,232 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory was 113.4MB in the beginning and 113.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:15:49,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.55ms. Allocated memory is still 157.3MB. Free memory was 88.2MB in the beginning and 122.6MB in the end (delta: -34.4MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-10-24 11:15:49,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.00ms. Allocated memory is still 157.3MB. Free memory was 122.6MB in the beginning and 118.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:15:49,233 INFO L158 Benchmark]: Boogie Preprocessor took 126.21ms. Allocated memory is still 157.3MB. Free memory was 118.5MB in the beginning and 112.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:15:49,234 INFO L158 Benchmark]: RCFGBuilder took 775.77ms. Allocated memory is still 157.3MB. Free memory was 112.8MB in the beginning and 72.3MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-24 11:15:49,234 INFO L158 Benchmark]: TraceAbstraction took 3915.00ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 71.8MB in the beginning and 79.5MB in the end (delta: -7.8MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-10-24 11:15:49,234 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 216.0MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:15:49,238 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory was 113.4MB in the beginning and 113.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.55ms. Allocated memory is still 157.3MB. Free memory was 88.2MB in the beginning and 122.6MB in the end (delta: -34.4MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.00ms. Allocated memory is still 157.3MB. Free memory was 122.6MB in the beginning and 118.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.21ms. Allocated memory is still 157.3MB. Free memory was 118.5MB in the beginning and 112.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 775.77ms. Allocated memory is still 157.3MB. Free memory was 112.8MB in the beginning and 72.3MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3915.00ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 71.8MB in the beginning and 79.5MB in the end (delta: -7.8MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 216.0MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of shiftRight at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L25-L27] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L25-L27] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L25-L27] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L25-L27] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L25-L27] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L28-L30] float float_Array_0[2] = { 4.25, 9999999999.875 }; [L28-L30] float float_Array_0[2] = { 4.25, 9999999999.875 }; [L28-L30] float float_Array_0[2] = { 4.25, 9999999999.875 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L37] unsigned char last_1_unsigned_char_Array_0_1_ = 1; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] EXPR unsigned_char_Array_0[1] [L95] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] double_Array_0[0][0] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[0][0] [L81] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F [L81] EXPR double_Array_0[0][0] [L81] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] CALL assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] RET assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] double_Array_0[1][0] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[1][0] [L83] EXPR double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] EXPR double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F [L83] EXPR double_Array_0[1][0] [L83] EXPR double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] EXPR (double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] EXPR (double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not((double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not((double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] double_Array_0[1][1] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] float_Array_0[0] = __VERIFIER_nondet_float() [L87] EXPR float_Array_0[0] [L87] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L87] EXPR float_Array_0[0] [L87] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] float_Array_0[1] = __VERIFIER_nondet_float() [L89] EXPR float_Array_0[1] [L89] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L89] EXPR float_Array_0[1] [L89] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] RET updateVariables() [L107] CALL step() [L41] EXPR last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) [L44] EXPR double_Array_0[1][0] [L44] EXPR double_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] COND FALSE !(double_Array_0[1][0] == (- double_Array_0[0][0])) [L51] unsigned_char_Array_0[1] = 0 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L53] EXPR float_Array_0[0] [L53] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L53] COND TRUE float_Array_0[0] > float_Array_0[1] [L54] double_Array_0[0][1] = 4.6 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR double_Array_0[0][1] [L58] EXPR double_Array_0[0][1] [L58] unsigned char stepLocal_0 = double_Array_0[0][1] > double_Array_0[0][1]; [L59] stepLocal_0 && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] stepLocal_0 && BOOL_unsigned_char_Array_0[1] [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] stepLocal_0 && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] COND TRUE stepLocal_0 && BOOL_unsigned_char_Array_0[1] [L60] EXPR double_Array_0[0][1] [L60] EXPR double_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR ((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])) [L60] EXPR double_Array_0[0][1] [L60] EXPR ((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR double_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] COND TRUE ((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1] [L61] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L61] COND TRUE BOOL_unsigned_char_Array_0[1] [L62] unsigned_long_int_Array_0[0] = 10u VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR double_Array_0[0][1] [L98] EXPR double_Array_0[0][1] [L98] EXPR (double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR (double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR ((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) [L98] EXPR unsigned_long_int_Array_0[0] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR ((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR (((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR (((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR ((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR ((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR (((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0])))))))))) && ((double_Array_0[1][0] == (- double_Array_0[0][0])) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) 0))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR (((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0])))))))))) && ((double_Array_0[1][0] == (- double_Array_0[0][0])) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) 0))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98-L99] return (((((double_Array_0[0][1] > double_Array_0[0][1]) && BOOL_unsigned_char_Array_0[1]) ? ((((((double_Array_0[0][1]) > ((- double_Array_0[0][1]))) ? (double_Array_0[0][1]) : ((- double_Array_0[0][1])))) != double_Array_0[0][1]) ? (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 10u)) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]))) : 1)) && ((float_Array_0[0] > float_Array_0[1]) ? (double_Array_0[0][1] == ((double) 4.6)) : (double_Array_0[0][1] == ((double) ((((double_Array_0[1][1]) > (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0]))))) ? (double_Array_0[1][1]) : (((((double_Array_0[0][0]) > (double_Array_0[1][0])) ? (double_Array_0[0][0]) : (double_Array_0[1][0])))))))))) && ((double_Array_0[1][0] == (- double_Array_0[0][0])) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[1]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) 0))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 578 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 578 mSDsluCounter, 2722 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1746 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 976 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=6, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 272 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 734 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 619 ConstructedInterpolants, 0 QuantifiedInterpolants, 1510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1320/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:15:49,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-a_file-36.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 41f77efcfe33be11618a361f7eb55ba9d9569bca80921eb0046d4538ba494080 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:15:51,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:15:51,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:15:51,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:15:51,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:15:51,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:15:51,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:15:51,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:15:51,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:15:51,664 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:15:51,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:15:51,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:15:51,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:15:51,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:15:51,668 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:15:51,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:15:51,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:15:51,669 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:15:51,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:15:51,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:15:51,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:15:51,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:15:51,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:15:51,674 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:15:51,674 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:15:51,675 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:15:51,675 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:15:51,675 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:15:51,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:15:51,675 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:15:51,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:15:51,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:15:51,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:15:51,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:15:51,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:15:51,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:15:51,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:15:51,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:15:51,679 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:15:51,680 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:15:51,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:15:51,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:15:51,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:15:51,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:15:51,682 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:15:51,682 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 -> 41f77efcfe33be11618a361f7eb55ba9d9569bca80921eb0046d4538ba494080 [2024-10-24 11:15:52,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:15:52,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:15:52,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:15:52,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:15:52,075 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:15:52,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i [2024-10-24 11:15:53,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:15:53,890 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:15:53,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-36.i [2024-10-24 11:15:53,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634c7148d/dc6726a0803b462490b755dabf33f5e6/FLAG7b8a8d8a1 [2024-10-24 11:15:53,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634c7148d/dc6726a0803b462490b755dabf33f5e6 [2024-10-24 11:15:53,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:15:53,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:15:53,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:15:53,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:15:53,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:15:53,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:15:53" (1/1) ... [2024-10-24 11:15:53,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8761d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:53, skipping insertion in model container [2024-10-24 11:15:53,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:15:53" (1/1) ... [2024-10-24 11:15:53,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:15:54,135 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-a_file-36.i[916,929] [2024-10-24 11:15:54,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:15:54,238 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:15:54,259 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-a_file-36.i[916,929] [2024-10-24 11:15:54,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:15:54,355 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:15:54,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54 WrapperNode [2024-10-24 11:15:54,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:15:54,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:15:54,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:15:54,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:15:54,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,428 INFO L138 Inliner]: procedures = 36, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 544 [2024-10-24 11:15:54,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:15:54,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:15:54,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:15:54,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:15:54,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,484 INFO L175 MemorySlicer]: Split 133 memory accesses to 6 slices as follows [2, 23, 61, 16, 22, 9]. 46 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 4, 2, 2, 1]. The 18 writes are split as follows [0, 3, 5, 2, 4, 4]. [2024-10-24 11:15:54,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:15:54,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:15:54,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:15:54,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:15:54,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (1/1) ... [2024-10-24 11:15:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:15:54,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:15:54,577 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-24 11:15:54,580 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-24 11:15:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:15:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:15:54,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:15:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:15:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:15:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:15:54,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-24 11:15:54,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:15:54,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:15:54,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:15:54,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:15:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:15:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-24 11:15:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:15:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:15:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:15:54,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:15:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:15:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:15:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:15:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:15:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:15:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:15:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:15:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:15:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:15:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:15:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:15:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:15:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:15:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 11:15:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:15:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:15:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:15:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:15:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:15:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:15:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:15:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:15:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:15:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:15:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:15:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-24 11:15:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:15:54,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:15:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:15:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:15:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:15:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 11:15:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:15:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:15:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:15:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:15:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:15:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:15:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:15:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:15:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:15:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:15:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:15:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:15:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:15:54,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:15:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:15:54,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:15:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:15:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:15:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 11:15:54,852 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:15:54,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:15:55,781 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-10-24 11:15:55,782 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:15:55,846 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:15:55,846 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:15:55,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:15:55 BoogieIcfgContainer [2024-10-24 11:15:55,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:15:55,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:15:55,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:15:55,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:15:55,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:15:53" (1/3) ... [2024-10-24 11:15:55,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202e5585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:15:55, skipping insertion in model container [2024-10-24 11:15:55,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:54" (2/3) ... [2024-10-24 11:15:55,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202e5585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:15:55, skipping insertion in model container [2024-10-24 11:15:55,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:15:55" (3/3) ... [2024-10-24 11:15:55,856 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-36.i [2024-10-24 11:15:55,875 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:15:55,876 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:15:55,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:15:55,953 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;@393720bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:15:55,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:15:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:15:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:15:55,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:55,974 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:55,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:55,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1217459253, now seen corresponding path program 1 times [2024-10-24 11:15:55,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:55,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487195673] [2024-10-24 11:15:55,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:55,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:55,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:55,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:56,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:15:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:56,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:15:56,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 11:15:56,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:15:56,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:15:56,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487195673] [2024-10-24 11:15:56,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487195673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:56,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:56,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:15:56,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351780715] [2024-10-24 11:15:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:56,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:15:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:15:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:15:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:15:56,461 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:15:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:56,520 INFO L93 Difference]: Finished difference Result 217 states and 345 transitions. [2024-10-24 11:15:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:15:56,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-24 11:15:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:56,537 INFO L225 Difference]: With dead ends: 217 [2024-10-24 11:15:56,538 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:15:56,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-24 11:15:56,544 INFO L432 NwaCegarLoop]: 154 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, 154 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-24 11:15:56,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:15:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 11:15:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:15:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2024-10-24 11:15:56,602 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 103 [2024-10-24 11:15:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:56,602 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2024-10-24 11:15:56,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:15:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2024-10-24 11:15:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:15:56,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:56,608 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:56,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:15:56,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:56,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:56,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:56,810 INFO L85 PathProgramCache]: Analyzing trace with hash 644138359, now seen corresponding path program 1 times [2024-10-24 11:15:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:56,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063939448] [2024-10-24 11:15:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:56,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:56,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:56,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:56,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:15:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:57,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:15:57,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 11:15:57,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:15:57,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:15:57,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063939448] [2024-10-24 11:15:57,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063939448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:57,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:57,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6331257] [2024-10-24 11:15:57,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:57,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:57,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:15:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:57,204 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:15:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:57,305 INFO L93 Difference]: Finished difference Result 213 states and 318 transitions. [2024-10-24 11:15:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-24 11:15:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:57,311 INFO L225 Difference]: With dead ends: 213 [2024-10-24 11:15:57,311 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 11:15:57,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 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-24 11:15:57,313 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:57,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 11:15:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-24 11:15:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:15:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2024-10-24 11:15:57,328 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 103 [2024-10-24 11:15:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:57,333 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2024-10-24 11:15:57,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:15:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2024-10-24 11:15:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:15:57,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:57,335 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:57,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:15:57,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:57,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:57,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash 83438581, now seen corresponding path program 1 times [2024-10-24 11:15:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:57,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295612425] [2024-10-24 11:15:57,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:57,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:57,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:57,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:15:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:57,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:15:57,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:57,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:15:57,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 64 [2024-10-24 11:15:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:15:57,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:15:57,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:15:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295612425] [2024-10-24 11:15:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295612425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:57,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:57,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:15:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713994318] [2024-10-24 11:15:57,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:57,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:15:57,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:15:57,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:15:57,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:57,955 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:57,990 INFO L93 Difference]: Finished difference Result 211 states and 312 transitions. [2024-10-24 11:15:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:15:57,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 11:15:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:57,993 INFO L225 Difference]: With dead ends: 211 [2024-10-24 11:15:57,993 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:15:57,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:57,995 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:57,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:15:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 11:15:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:15:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-10-24 11:15:58,004 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 103 [2024-10-24 11:15:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:58,004 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-10-24 11:15:58,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-10-24 11:15:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:15:58,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:58,006 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:58,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:15:58,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:58,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:58,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash -927678669, now seen corresponding path program 1 times [2024-10-24 11:15:58,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:58,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980732496] [2024-10-24 11:15:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:58,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:58,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:58,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:58,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:15:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:58,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:15:58,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:58,606 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 14 treesize of output 10 [2024-10-24 11:15:58,655 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 19 treesize of output 15 [2024-10-24 11:15:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:15:58,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:15:58,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:15:58,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980732496] [2024-10-24 11:15:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980732496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16407175] [2024-10-24 11:15:58,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:58,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:15:58,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:58,721 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:58,949 INFO L93 Difference]: Finished difference Result 322 states and 468 transitions. [2024-10-24 11:15:58,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:15:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 11:15:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:58,952 INFO L225 Difference]: With dead ends: 322 [2024-10-24 11:15:58,953 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 11:15:58,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:15:58,956 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 152 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:58,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 939 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:15:58,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 11:15:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 119. [2024-10-24 11:15:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 106 states have internal predecessors, (150), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:15:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-10-24 11:15:58,968 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 103 [2024-10-24 11:15:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:58,968 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-10-24 11:15:58,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-10-24 11:15:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:15:58,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:58,970 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:58,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:15:59,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:59,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:59,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash -603587455, now seen corresponding path program 1 times [2024-10-24 11:15:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626444295] [2024-10-24 11:15:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:59,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:59,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:59,178 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:59,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:15:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:59,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:15:59,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:15:59,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:15:59,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:15:59,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626444295] [2024-10-24 11:15:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626444295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:59,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:15:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372013623] [2024-10-24 11:15:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:59,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:15:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:15:59,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:15:59,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:15:59,553 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:59,609 INFO L93 Difference]: Finished difference Result 239 states and 346 transitions. [2024-10-24 11:15:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:15:59,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:15:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:59,611 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:15:59,611 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 11:15:59,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 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-24 11:15:59,612 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:59,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 11:15:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-24 11:15:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:15:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-10-24 11:15:59,628 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 105 [2024-10-24 11:15:59,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:59,634 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-10-24 11:15:59,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:15:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-10-24 11:15:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:15:59,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:59,635 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:15:59,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:15:59,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:59,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:59,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1545757915, now seen corresponding path program 1 times [2024-10-24 11:15:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128110479] [2024-10-24 11:15:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:59,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:59,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:59,840 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:59,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:16:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:00,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:16:00,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:16:00,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:00,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128110479] [2024-10-24 11:16:00,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128110479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:00,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:00,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:16:00,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503044116] [2024-10-24 11:16:00,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:00,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:00,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:00,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:00,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:16:00,217 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:00,353 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2024-10-24 11:16:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:16:00,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:16:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:00,355 INFO L225 Difference]: With dead ends: 243 [2024-10-24 11:16:00,355 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 11:16:00,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:16:00,356 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 137 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:00,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 370 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 11:16:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-10-24 11:16:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.385321100917431) internal successors, (151), 109 states have internal predecessors, (151), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:16:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2024-10-24 11:16:00,380 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 105 [2024-10-24 11:16:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:00,381 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2024-10-24 11:16:00,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2024-10-24 11:16:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:16:00,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:00,383 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:00,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:00,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:00,585 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:00,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:00,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2048144803, now seen corresponding path program 1 times [2024-10-24 11:16:00,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:00,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266003875] [2024-10-24 11:16:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:00,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:00,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:00,588 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:00,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:16:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:00,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:16:00,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:00,888 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 19 treesize of output 15 [2024-10-24 11:16:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:16:00,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:00,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266003875] [2024-10-24 11:16:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266003875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:00,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:16:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021945566] [2024-10-24 11:16:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:00,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:00,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:00,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:00,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:16:00,933 INFO L87 Difference]: Start difference. First operand 122 states and 173 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:01,048 INFO L93 Difference]: Finished difference Result 245 states and 348 transitions. [2024-10-24 11:16:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:16:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:16:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:01,051 INFO L225 Difference]: With dead ends: 245 [2024-10-24 11:16:01,051 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 11:16:01,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:16:01,052 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 129 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:01,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 397 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 11:16:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2024-10-24 11:16:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:16:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-24 11:16:01,072 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 105 [2024-10-24 11:16:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:01,074 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-24 11:16:01,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-24 11:16:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:16:01,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:01,076 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:01,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 11:16:01,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:01,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:01,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash 399039076, now seen corresponding path program 1 times [2024-10-24 11:16:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:01,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400074025] [2024-10-24 11:16:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:01,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:01,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:01,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:01,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:16:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:01,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:16:01,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:01,559 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 14 treesize of output 10 [2024-10-24 11:16:01,584 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 19 treesize of output 15 [2024-10-24 11:16:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:16:01,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:01,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:01,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400074025] [2024-10-24 11:16:01,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400074025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:01,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:01,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:16:01,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995723349] [2024-10-24 11:16:01,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:01,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:16:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:01,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:16:01,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:16:01,692 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:01,925 INFO L93 Difference]: Finished difference Result 338 states and 478 transitions. [2024-10-24 11:16:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:16:01,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:16:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:01,927 INFO L225 Difference]: With dead ends: 338 [2024-10-24 11:16:01,927 INFO L226 Difference]: Without dead ends: 230 [2024-10-24 11:16:01,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:16:01,929 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 149 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:01,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1144 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:16:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-24 11:16:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 127. [2024-10-24 11:16:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 114 states have internal predecessors, (158), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:16:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2024-10-24 11:16:01,951 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 107 [2024-10-24 11:16:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:01,951 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2024-10-24 11:16:01,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2024-10-24 11:16:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 11:16:01,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:01,952 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:01,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:16:02,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:02,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:02,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -485913816, now seen corresponding path program 1 times [2024-10-24 11:16:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:02,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992029384] [2024-10-24 11:16:02,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:02,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:02,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:02,156 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:02,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 11:16:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:02,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:16:02,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:02,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:16:02,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-10-24 11:16:02,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:02,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 53 [2024-10-24 11:16:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:16:02,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:02,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992029384] [2024-10-24 11:16:02,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992029384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:02,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:02,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:16:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404439561] [2024-10-24 11:16:02,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:02,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:16:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:16:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:16:02,980 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:04,755 INFO L93 Difference]: Finished difference Result 382 states and 542 transitions. [2024-10-24 11:16:04,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:16:04,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-24 11:16:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:04,758 INFO L225 Difference]: With dead ends: 382 [2024-10-24 11:16:04,758 INFO L226 Difference]: Without dead ends: 256 [2024-10-24 11:16:04,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:16:04,759 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 221 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:04,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 738 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 11:16:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-24 11:16:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2024-10-24 11:16:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 152 states have (on average 1.368421052631579) internal successors, (208), 152 states have internal predecessors, (208), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:16:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 230 transitions. [2024-10-24 11:16:04,773 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 230 transitions. Word has length 107 [2024-10-24 11:16:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:04,773 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 230 transitions. [2024-10-24 11:16:04,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 230 transitions. [2024-10-24 11:16:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:16:04,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:04,775 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:04,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 11:16:04,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:04,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:04,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash -521153345, now seen corresponding path program 1 times [2024-10-24 11:16:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:04,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257532984] [2024-10-24 11:16:04,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:04,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:04,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:04,980 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:04,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 11:16:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:05,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:16:05,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:05,510 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 25 treesize of output 10 [2024-10-24 11:16:05,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:05,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 66 [2024-10-24 11:16:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:16:05,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:05,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257532984] [2024-10-24 11:16:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257532984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:05,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:16:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810632782] [2024-10-24 11:16:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:05,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:05,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:16:05,590 INFO L87 Difference]: Start difference. First operand 165 states and 230 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:06,573 INFO L93 Difference]: Finished difference Result 388 states and 545 transitions. [2024-10-24 11:16:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:16:06,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-10-24 11:16:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:06,575 INFO L225 Difference]: With dead ends: 388 [2024-10-24 11:16:06,575 INFO L226 Difference]: Without dead ends: 224 [2024-10-24 11:16:06,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:16:06,576 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 221 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:06,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 403 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:16:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-24 11:16:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 114. [2024-10-24 11:16:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:16:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 153 transitions. [2024-10-24 11:16:06,589 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 153 transitions. Word has length 109 [2024-10-24 11:16:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:06,589 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 153 transitions. [2024-10-24 11:16:06,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 153 transitions. [2024-10-24 11:16:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:16:06,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:06,591 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:06,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:06,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:06,791 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:06,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash 511097116, now seen corresponding path program 1 times [2024-10-24 11:16:06,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:06,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057361403] [2024-10-24 11:16:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:06,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:06,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:06,794 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:06,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 11:16:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:07,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:16:07,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:07,090 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 14 treesize of output 10 [2024-10-24 11:16:07,144 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 43 treesize of output 25 [2024-10-24 11:16:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:16:07,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:07,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:07,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057361403] [2024-10-24 11:16:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057361403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:07,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:16:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329992006] [2024-10-24 11:16:07,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:07,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:16:07,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:16:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:16:07,167 INFO L87 Difference]: Start difference. First operand 114 states and 153 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:07,321 INFO L93 Difference]: Finished difference Result 232 states and 310 transitions. [2024-10-24 11:16:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:16:07,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-10-24 11:16:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:07,323 INFO L225 Difference]: With dead ends: 232 [2024-10-24 11:16:07,323 INFO L226 Difference]: Without dead ends: 230 [2024-10-24 11:16:07,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:16:07,324 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 115 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:07,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 913 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-24 11:16:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 162. [2024-10-24 11:16:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:16:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2024-10-24 11:16:07,337 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 109 [2024-10-24 11:16:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:07,338 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2024-10-24 11:16:07,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2024-10-24 11:16:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 11:16:07,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:07,339 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:07,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 11:16:07,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:07,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:07,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1445923524, now seen corresponding path program 1 times [2024-10-24 11:16:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:07,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563464669] [2024-10-24 11:16:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:07,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:07,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:07,542 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:07,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 11:16:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:07,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 11:16:07,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:08,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:08,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 58 [2024-10-24 11:16:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 11:16:08,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:16:08,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:08,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563464669] [2024-10-24 11:16:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563464669] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:08,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:16:08,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-24 11:16:08,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099046419] [2024-10-24 11:16:08,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:08,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:08,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:08,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:08,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:16:08,722 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:08,952 INFO L93 Difference]: Finished difference Result 373 states and 492 transitions. [2024-10-24 11:16:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:16:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-10-24 11:16:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:08,954 INFO L225 Difference]: With dead ends: 373 [2024-10-24 11:16:08,955 INFO L226 Difference]: Without dead ends: 212 [2024-10-24 11:16:08,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:16:08,956 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 118 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:08,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 465 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:16:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-24 11:16:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2024-10-24 11:16:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 188 states have (on average 1.2819148936170213) internal successors, (241), 189 states have internal predecessors, (241), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:16:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 277 transitions. [2024-10-24 11:16:08,975 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 277 transitions. Word has length 110 [2024-10-24 11:16:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:08,976 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 277 transitions. [2024-10-24 11:16:08,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 277 transitions. [2024-10-24 11:16:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 11:16:08,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:08,981 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:08,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:09,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:09,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:09,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1829425855, now seen corresponding path program 1 times [2024-10-24 11:16:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:09,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485535839] [2024-10-24 11:16:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:09,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:09,185 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:09,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 11:16:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:09,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 11:16:09,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:10,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:10,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 59 [2024-10-24 11:16:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 11:16:10,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:16:10,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:10,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485535839] [2024-10-24 11:16:10,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485535839] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:10,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:16:10,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-24 11:16:10,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805494791] [2024-10-24 11:16:10,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:10,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:10,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:10,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:16:10,504 INFO L87 Difference]: Start difference. First operand 209 states and 277 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:10,803 INFO L93 Difference]: Finished difference Result 424 states and 558 transitions. [2024-10-24 11:16:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:16:10,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-10-24 11:16:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:10,807 INFO L225 Difference]: With dead ends: 424 [2024-10-24 11:16:10,807 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 11:16:10,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:16:10,809 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 80 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:10,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 499 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:16:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 11:16:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 166. [2024-10-24 11:16:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.243421052631579) internal successors, (189), 152 states have internal predecessors, (189), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:16:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2024-10-24 11:16:10,825 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 110 [2024-10-24 11:16:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:10,826 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2024-10-24 11:16:10,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:16:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2024-10-24 11:16:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:16:10,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:10,829 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:10,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:11,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:11,030 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:11,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:11,031 INFO L85 PathProgramCache]: Analyzing trace with hash -949255996, now seen corresponding path program 1 times [2024-10-24 11:16:11,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:11,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969975941] [2024-10-24 11:16:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:11,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:11,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:11,032 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:11,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 11:16:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:11,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:16:11,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:11,406 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 8 treesize of output 1 [2024-10-24 11:16:11,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:11,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 57 [2024-10-24 11:16:12,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:12,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 95 [2024-10-24 11:16:12,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:12,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 253 treesize of output 91 [2024-10-24 11:16:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 120 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:16:12,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:13,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969975941] [2024-10-24 11:16:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969975941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [402482581] [2024-10-24 11:16:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:13,153 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:16:13,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:16:13,155 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:16:13,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-10-24 11:16:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:14,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 11:16:14,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:15,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-24 11:16:16,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 79 [2024-10-24 11:16:17,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:17,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 85 [2024-10-24 11:16:18,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:18,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 87 [2024-10-24 11:16:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 120 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:16:22,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [402482581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:27,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:16:27,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-10-24 11:16:27,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192196891] [2024-10-24 11:16:27,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:16:27,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 11:16:27,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:27,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 11:16:27,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=675, Unknown=2, NotChecked=0, Total=812 [2024-10-24 11:16:27,639 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand has 21 states, 21 states have (on average 5.0) internal successors, (105), 20 states have internal predecessors, (105), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-24 11:16:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:34,810 INFO L93 Difference]: Finished difference Result 601 states and 764 transitions. [2024-10-24 11:16:34,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:16:34,813 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.0) internal successors, (105), 20 states have internal predecessors, (105), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 111 [2024-10-24 11:16:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:34,815 INFO L225 Difference]: With dead ends: 601 [2024-10-24 11:16:34,815 INFO L226 Difference]: Without dead ends: 436 [2024-10-24 11:16:34,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=226, Invalid=962, Unknown=2, NotChecked=0, Total=1190 [2024-10-24 11:16:34,816 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1107 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:34,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1032 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-24 11:16:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-24 11:16:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 430. [2024-10-24 11:16:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 391 states have (on average 1.2404092071611252) internal successors, (485), 393 states have internal predecessors, (485), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 11:16:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 549 transitions. [2024-10-24 11:16:34,853 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 549 transitions. Word has length 111 [2024-10-24 11:16:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:34,853 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 549 transitions. [2024-10-24 11:16:34,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.0) internal successors, (105), 20 states have internal predecessors, (105), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-24 11:16:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 549 transitions. [2024-10-24 11:16:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:16:34,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:34,856 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:34,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:35,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:35,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:35,257 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:35,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1268374402, now seen corresponding path program 1 times [2024-10-24 11:16:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118185824] [2024-10-24 11:16:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:35,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:35,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:35,261 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:35,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 11:16:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:35,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:16:35,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 11:16:35,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:35,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:35,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118185824] [2024-10-24 11:16:35,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118185824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:35,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:35,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:16:35,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756611823] [2024-10-24 11:16:35,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:35,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:16:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:35,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:16:35,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:16:35,546 INFO L87 Difference]: Start difference. First operand 430 states and 549 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:16:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:35,710 INFO L93 Difference]: Finished difference Result 861 states and 1100 transitions. [2024-10-24 11:16:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:16:35,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-10-24 11:16:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:35,716 INFO L225 Difference]: With dead ends: 861 [2024-10-24 11:16:35,716 INFO L226 Difference]: Without dead ends: 432 [2024-10-24 11:16:35,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 108 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-24 11:16:35,719 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:35,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 380 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-24 11:16:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-10-24 11:16:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 393 states have (on average 1.2366412213740459) internal successors, (486), 395 states have internal predecessors, (486), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 11:16:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 550 transitions. [2024-10-24 11:16:35,762 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 550 transitions. Word has length 111 [2024-10-24 11:16:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:35,762 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 550 transitions. [2024-10-24 11:16:35,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:16:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 550 transitions. [2024-10-24 11:16:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:16:35,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:35,764 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:35,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:35,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:35,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:35,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash 927226822, now seen corresponding path program 1 times [2024-10-24 11:16:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455799625] [2024-10-24 11:16:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:35,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:35,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:35,968 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:35,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 11:16:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:36,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:16:36,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-24 11:16:36,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:36,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:36,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455799625] [2024-10-24 11:16:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455799625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:36,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:36,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:16:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215968129] [2024-10-24 11:16:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:36,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:16:36,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:36,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:16:36,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:16:36,256 INFO L87 Difference]: Start difference. First operand 432 states and 550 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:16:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:36,372 INFO L93 Difference]: Finished difference Result 863 states and 1099 transitions. [2024-10-24 11:16:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:16:36,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-10-24 11:16:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:36,375 INFO L225 Difference]: With dead ends: 863 [2024-10-24 11:16:36,375 INFO L226 Difference]: Without dead ends: 432 [2024-10-24 11:16:36,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 108 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-24 11:16:36,377 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:36,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 380 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-24 11:16:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-10-24 11:16:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 393 states have (on average 1.2340966921119594) internal successors, (485), 395 states have internal predecessors, (485), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 11:16:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 549 transitions. [2024-10-24 11:16:36,420 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 549 transitions. Word has length 111 [2024-10-24 11:16:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:36,421 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 549 transitions. [2024-10-24 11:16:36,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:16:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 549 transitions. [2024-10-24 11:16:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:16:36,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:36,423 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:16:36,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:36,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:36,624 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:36,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1121181618, now seen corresponding path program 1 times [2024-10-24 11:16:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056009857] [2024-10-24 11:16:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:36,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:36,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:36,628 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:36,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 11:16:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:37,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 11:16:37,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:37,130 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 8 treesize of output 1 [2024-10-24 11:16:37,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 77 [2024-10-24 11:16:38,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:38,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 253 treesize of output 143 [2024-10-24 11:16:43,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:43,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 243 treesize of output 175 [2024-10-24 11:16:52,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:52,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 257 treesize of output 95 [2024-10-24 11:16:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 120 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 11:16:52,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:53,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056009857] [2024-10-24 11:16:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056009857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [871308651] [2024-10-24 11:16:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:53,714 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:16:53,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:16:53,717 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:16:53,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-10-24 11:16:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:55,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:16:55,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:55,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-10-24 11:16:56,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 63