./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-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-69.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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:27:36,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:27:36,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:27:36,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:27:36,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:27:36,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:27:36,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:27:36,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:27:36,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:27:36,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:27:36,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:27:36,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:27:36,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:27:36,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:27:36,294 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:27:36,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:27:36,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:27:36,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:27:36,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:27:36,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:27:36,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:27:36,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:27:36,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:27:36,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:27:36,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:27:36,297 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:27:36,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:27:36,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:27:36,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:27:36,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:27:36,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:27:36,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:27:36,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:27:36,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:27:36,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:27:36,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:27:36,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:27:36,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:27:36,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:27:36,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:27:36,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:27:36,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:27:36,303 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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2024-10-14 13:27:36,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:27:36,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:27:36,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:27:36,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:27:36,535 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:27:36,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-10-14 13:27:37,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:27:38,015 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:27:38,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-10-14 13:27:38,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218b0e0e3/07e85a35cd604e40b7e0f4597e04edd1/FLAG603641838 [2024-10-14 13:27:38,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218b0e0e3/07e85a35cd604e40b7e0f4597e04edd1 [2024-10-14 13:27:38,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:27:38,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:27:38,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:27:38,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:27:38,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:27:38,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5c225b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38, skipping insertion in model container [2024-10-14 13:27:38,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:27:38,208 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-69.i[916,929] [2024-10-14 13:27:38,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:27:38,298 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:27:38,312 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-69.i[916,929] [2024-10-14 13:27:38,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:27:38,387 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:27:38,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38 WrapperNode [2024-10-14 13:27:38,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:27:38,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:27:38,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:27:38,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:27:38,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,458 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2024-10-14 13:27:38,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:27:38,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:27:38,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:27:38,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:27:38,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,486 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2024-10-14 13:27:38,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:27:38,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:27:38,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:27:38,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:27:38,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (1/1) ... [2024-10-14 13:27:38,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:27:38,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:27:38,538 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-14 13:27:38,539 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-14 13:27:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:27:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:27:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:27:38,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:27:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:27:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:27:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:27:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:27:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:27:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:27:38,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:27:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:27:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:27:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:27:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:27:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:27:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:27:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:27:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:27:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:27:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:27:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:27:38,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:27:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:27:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:27:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:27:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:27:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:27:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:27:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:27:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:27:38,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:27:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:27:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:27:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:27:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:27:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:27:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:27:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:27:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:27:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:27:38,694 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:27:38,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:27:39,102 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-14 13:27:39,103 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:27:39,151 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:27:39,152 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:27:39,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:27:39 BoogieIcfgContainer [2024-10-14 13:27:39,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:27:39,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:27:39,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:27:39,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:27:39,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:27:38" (1/3) ... [2024-10-14 13:27:39,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef7ae8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:27:39, skipping insertion in model container [2024-10-14 13:27:39,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:38" (2/3) ... [2024-10-14 13:27:39,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef7ae8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:27:39, skipping insertion in model container [2024-10-14 13:27:39,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:27:39" (3/3) ... [2024-10-14 13:27:39,160 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2024-10-14 13:27:39,179 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:27:39,180 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:27:39,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:27:39,260 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;@7fb6b868, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:27:39,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:27:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 13:27:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 13:27:39,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:39,274 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:39,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:39,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:39,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1533142486, now seen corresponding path program 1 times [2024-10-14 13:27:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744364573] [2024-10-14 13:27:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:27:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:27:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:27:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:27:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:27:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:27:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:27:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:27:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:27:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:27:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:27:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:39,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:39,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744364573] [2024-10-14 13:27:39,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744364573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:39,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:39,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:27:39,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779528597] [2024-10-14 13:27:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:39,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:27:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:27:39,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:27:39,784 INFO L87 Difference]: Start difference. First operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:39,872 INFO L93 Difference]: Finished difference Result 171 states and 277 transitions. [2024-10-14 13:27:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:27:39,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-14 13:27:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:39,881 INFO L225 Difference]: With dead ends: 171 [2024-10-14 13:27:39,882 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 13:27:39,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-14 13:27:39,889 INFO L432 NwaCegarLoop]: 123 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, 123 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-14 13:27:39,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:27:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 13:27:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-14 13:27:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 13:27:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-10-14 13:27:39,925 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 114 [2024-10-14 13:27:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:39,925 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-10-14 13:27:39,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-10-14 13:27:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 13:27:39,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:39,929 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:39,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:27:39,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:39,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1404825800, now seen corresponding path program 1 times [2024-10-14 13:27:39,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:39,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559195770] [2024-10-14 13:27:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:39,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:27:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:27:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:27:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:27:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:27:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:27:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:27:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:27:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:27:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:27:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:27:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:40,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559195770] [2024-10-14 13:27:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559195770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:40,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:40,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:27:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420266108] [2024-10-14 13:27:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:40,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:27:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:40,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:27:40,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:27:40,317 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:40,358 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-10-14 13:27:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:27:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-14 13:27:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:40,361 INFO L225 Difference]: With dead ends: 171 [2024-10-14 13:27:40,361 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 13:27:40,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-14 13:27:40,362 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 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-14 13:27:40,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:27:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 13:27:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 13:27:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 13:27:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-14 13:27:40,374 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 114 [2024-10-14 13:27:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:40,376 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-14 13:27:40,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-14 13:27:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:27:40,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:40,378 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:40,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:27:40,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:40,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:40,379 INFO L85 PathProgramCache]: Analyzing trace with hash -452400419, now seen corresponding path program 1 times [2024-10-14 13:27:40,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:40,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265805561] [2024-10-14 13:27:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:27:40,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [798328015] [2024-10-14 13:27:40,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:40,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:27:40,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:27:40,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 13:27:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:40,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 13:27:40,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:40,846 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 9 treesize of output 3 [2024-10-14 13:27:40,866 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 1 [2024-10-14 13:27:40,871 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 1 [2024-10-14 13:27:40,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:40,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 19 [2024-10-14 13:27:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:41,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:27:41,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265805561] [2024-10-14 13:27:41,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:27:41,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798328015] [2024-10-14 13:27:41,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798328015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:41,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:41,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:27:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723098745] [2024-10-14 13:27:41,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:41,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:27:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:27:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:27:41,025 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:41,430 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2024-10-14 13:27:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:27:41,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-14 13:27:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:41,432 INFO L225 Difference]: With dead ends: 237 [2024-10-14 13:27:41,432 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 13:27:41,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:27:41,433 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 84 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:41,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 869 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:27:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 13:27:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-10-14 13:27:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 124 states have internal predecessors, (174), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:27:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2024-10-14 13:27:41,449 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 116 [2024-10-14 13:27:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:41,449 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2024-10-14 13:27:41,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2024-10-14 13:27:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:27:41,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:41,451 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:41,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 13:27:41,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:41,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:41,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash -194234981, now seen corresponding path program 1 times [2024-10-14 13:27:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539940647] [2024-10-14 13:27:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:27:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:27:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:41,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:27:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:27:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:27:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:27:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:27:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:27:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:27:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:27:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:27:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539940647] [2024-10-14 13:27:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539940647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:42,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:27:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872087536] [2024-10-14 13:27:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:42,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:27:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:42,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:27:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:27:42,020 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:42,221 INFO L93 Difference]: Finished difference Result 354 states and 520 transitions. [2024-10-14 13:27:42,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:27:42,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-14 13:27:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:42,224 INFO L225 Difference]: With dead ends: 354 [2024-10-14 13:27:42,224 INFO L226 Difference]: Without dead ends: 207 [2024-10-14 13:27:42,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:27:42,229 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 88 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:42,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 545 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:27:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-14 13:27:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-10-14 13:27:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.4023668639053255) internal successors, (237), 171 states have internal predecessors, (237), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 13:27:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 299 transitions. [2024-10-14 13:27:42,263 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 299 transitions. Word has length 116 [2024-10-14 13:27:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:42,266 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 299 transitions. [2024-10-14 13:27:42,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 299 transitions. [2024-10-14 13:27:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:27:42,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:42,268 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:42,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:27:42,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1848422171, now seen corresponding path program 1 times [2024-10-14 13:27:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:42,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834351326] [2024-10-14 13:27:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:27:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:27:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:27:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:27:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:27:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:27:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:27:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:27:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:27:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:27:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:27:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:42,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834351326] [2024-10-14 13:27:42,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834351326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:42,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:42,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:27:42,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977524081] [2024-10-14 13:27:42,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:42,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:27:42,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:42,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:27:42,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:27:42,801 INFO L87 Difference]: Start difference. First operand 204 states and 299 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:43,377 INFO L93 Difference]: Finished difference Result 612 states and 885 transitions. [2024-10-14 13:27:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 13:27:43,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-14 13:27:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:43,383 INFO L225 Difference]: With dead ends: 612 [2024-10-14 13:27:43,383 INFO L226 Difference]: Without dead ends: 409 [2024-10-14 13:27:43,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:27:43,385 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 283 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:43,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 811 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:27:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-14 13:27:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 290. [2024-10-14 13:27:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 243 states have (on average 1.3950617283950617) internal successors, (339), 246 states have internal predecessors, (339), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:27:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 419 transitions. [2024-10-14 13:27:43,414 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 419 transitions. Word has length 116 [2024-10-14 13:27:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:43,414 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 419 transitions. [2024-10-14 13:27:43,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 419 transitions. [2024-10-14 13:27:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:27:43,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:43,416 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:43,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:27:43,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:43,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2106587609, now seen corresponding path program 1 times [2024-10-14 13:27:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:43,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120272952] [2024-10-14 13:27:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:27:43,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467255208] [2024-10-14 13:27:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:43,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:43,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:27:43,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:27:43,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 13:27:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:43,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 13:27:43,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:43,748 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 1 [2024-10-14 13:27:43,755 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 1 [2024-10-14 13:27:43,763 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 1 [2024-10-14 13:27:43,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:43,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 19 [2024-10-14 13:27:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:43,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:27:43,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:43,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120272952] [2024-10-14 13:27:43,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:27:43,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467255208] [2024-10-14 13:27:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467255208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:43,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:27:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356467584] [2024-10-14 13:27:43,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:43,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:27:43,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:43,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:27:43,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:27:43,866 INFO L87 Difference]: Start difference. First operand 290 states and 419 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:44,169 INFO L93 Difference]: Finished difference Result 689 states and 994 transitions. [2024-10-14 13:27:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:27:44,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-14 13:27:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:44,172 INFO L225 Difference]: With dead ends: 689 [2024-10-14 13:27:44,172 INFO L226 Difference]: Without dead ends: 400 [2024-10-14 13:27:44,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:27:44,173 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 75 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:44,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1045 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:27:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-14 13:27:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 302. [2024-10-14 13:27:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 255 states have (on average 1.4) internal successors, (357), 258 states have internal predecessors, (357), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:27:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 437 transitions. [2024-10-14 13:27:44,206 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 437 transitions. Word has length 116 [2024-10-14 13:27:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:44,206 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 437 transitions. [2024-10-14 13:27:44,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 437 transitions. [2024-10-14 13:27:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:27:44,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:44,208 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:44,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 13:27:44,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 13:27:44,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:44,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -90664594, now seen corresponding path program 1 times [2024-10-14 13:27:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:44,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578014310] [2024-10-14 13:27:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:27:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:27:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:27:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:27:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:27:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:27:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:27:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:27:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:27:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:27:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:27:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:44,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:44,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578014310] [2024-10-14 13:27:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578014310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:44,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:27:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069485660] [2024-10-14 13:27:44,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:44,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:27:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:27:44,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:27:44,652 INFO L87 Difference]: Start difference. First operand 302 states and 437 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:44,840 INFO L93 Difference]: Finished difference Result 671 states and 964 transitions. [2024-10-14 13:27:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:27:44,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-14 13:27:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:44,843 INFO L225 Difference]: With dead ends: 671 [2024-10-14 13:27:44,843 INFO L226 Difference]: Without dead ends: 370 [2024-10-14 13:27:44,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 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-14 13:27:44,844 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 106 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:44,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 932 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:27:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-14 13:27:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 306. [2024-10-14 13:27:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 256 states have (on average 1.390625) internal successors, (356), 259 states have internal predecessors, (356), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 13:27:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 440 transitions. [2024-10-14 13:27:44,882 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 440 transitions. Word has length 117 [2024-10-14 13:27:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:44,882 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 440 transitions. [2024-10-14 13:27:44,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 440 transitions. [2024-10-14 13:27:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:27:44,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:44,884 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:44,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:27:44,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1350584819, now seen corresponding path program 1 times [2024-10-14 13:27:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217782182] [2024-10-14 13:27:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:27:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:27:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:27:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:27:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:27:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:27:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:27:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:27:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:27:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 13:27:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:27:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 13:27:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 13:27:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 13:27:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 13:27:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:45,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217782182] [2024-10-14 13:27:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217782182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:45,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:45,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:27:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243770873] [2024-10-14 13:27:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:45,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:27:45,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:45,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:27:45,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:27:45,206 INFO L87 Difference]: Start difference. First operand 306 states and 440 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:45,355 INFO L93 Difference]: Finished difference Result 771 states and 1103 transitions. [2024-10-14 13:27:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:27:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-14 13:27:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:45,358 INFO L225 Difference]: With dead ends: 771 [2024-10-14 13:27:45,358 INFO L226 Difference]: Without dead ends: 466 [2024-10-14 13:27:45,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 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-14 13:27:45,360 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 74 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:45,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 628 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:27:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-14 13:27:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 461. [2024-10-14 13:27:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 392 states have (on average 1.3826530612244898) internal successors, (542), 398 states have internal predecessors, (542), 57 states have call successors, (57), 11 states have call predecessors, (57), 11 states have return successors, (57), 51 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-14 13:27:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 656 transitions. [2024-10-14 13:27:45,398 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 656 transitions. Word has length 117 [2024-10-14 13:27:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:45,398 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 656 transitions. [2024-10-14 13:27:45,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 656 transitions. [2024-10-14 13:27:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 13:27:45,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:45,400 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:45,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:27:45,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:45,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1979290188, now seen corresponding path program 1 times [2024-10-14 13:27:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:45,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874535069] [2024-10-14 13:27:45,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:45,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:27:45,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763336025] [2024-10-14 13:27:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:45,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:45,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:27:45,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:27:45,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 13:27:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:45,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 13:27:45,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:45,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:27:45,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:27:45,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874535069] [2024-10-14 13:27:45,895 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:27:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763336025] [2024-10-14 13:27:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763336025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:27:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730891127] [2024-10-14 13:27:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:27:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:27:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:27:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:27:45,898 INFO L87 Difference]: Start difference. First operand 461 states and 656 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:46,217 INFO L93 Difference]: Finished difference Result 1176 states and 1675 transitions. [2024-10-14 13:27:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:27:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-14 13:27:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:46,222 INFO L225 Difference]: With dead ends: 1176 [2024-10-14 13:27:46,222 INFO L226 Difference]: Without dead ends: 731 [2024-10-14 13:27:46,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:27:46,224 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 84 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:46,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 405 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:27:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-14 13:27:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 591. [2024-10-14 13:27:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 514 states have (on average 1.3929961089494163) internal successors, (716), 521 states have internal predecessors, (716), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 57 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 13:27:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 844 transitions. [2024-10-14 13:27:46,315 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 844 transitions. Word has length 120 [2024-10-14 13:27:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:46,315 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 844 transitions. [2024-10-14 13:27:46,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 844 transitions. [2024-10-14 13:27:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 13:27:46,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:46,316 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:46,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 13:27:46,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:46,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:46,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:46,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1614612530, now seen corresponding path program 1 times [2024-10-14 13:27:46,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:27:46,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470214239] [2024-10-14 13:27:46,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:46,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:27:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:27:46,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120003252] [2024-10-14 13:27:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:46,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:46,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:27:46,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:27:46,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 13:27:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:27:46,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:27:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:27:46,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:27:46,999 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:27:47,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:27:47,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 13:27:47,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:27:47,208 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:27:47,271 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:27:47,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:27:47 BoogieIcfgContainer [2024-10-14 13:27:47,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:27:47,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:27:47,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:27:47,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:27:47,278 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:27:39" (3/4) ... [2024-10-14 13:27:47,280 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:27:47,281 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:27:47,282 INFO L158 Benchmark]: Toolchain (without parser) took 9238.92ms. Allocated memory was 142.6MB in the beginning and 337.6MB in the end (delta: 195.0MB). Free memory was 72.3MB in the beginning and 227.3MB in the end (delta: -155.0MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2024-10-14 13:27:47,285 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:27:47,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.49ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 72.1MB in the beginning and 179.7MB in the end (delta: -107.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-14 13:27:47,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.16ms. Allocated memory is still 209.7MB. Free memory was 179.6MB in the beginning and 179.3MB in the end (delta: 309.2kB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-14 13:27:47,286 INFO L158 Benchmark]: Boogie Preprocessor took 50.55ms. Allocated memory is still 209.7MB. Free memory was 179.3MB in the beginning and 174.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:27:47,286 INFO L158 Benchmark]: RCFGBuilder took 641.85ms. Allocated memory is still 209.7MB. Free memory was 174.1MB in the beginning and 138.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-14 13:27:47,286 INFO L158 Benchmark]: TraceAbstraction took 8118.99ms. Allocated memory was 209.7MB in the beginning and 337.6MB in the end (delta: 127.9MB). Free memory was 137.4MB in the beginning and 228.3MB in the end (delta: -90.9MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-10-14 13:27:47,286 INFO L158 Benchmark]: Witness Printer took 7.61ms. Allocated memory is still 337.6MB. Free memory is still 227.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:27:47,287 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.13ms. Allocated memory is still 142.6MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.49ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 72.1MB in the beginning and 179.7MB in the end (delta: -107.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.16ms. Allocated memory is still 209.7MB. Free memory was 179.6MB in the beginning and 179.3MB in the end (delta: 309.2kB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.55ms. Allocated memory is still 209.7MB. Free memory was 179.3MB in the beginning and 174.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 641.85ms. Allocated memory is still 209.7MB. Free memory was 174.1MB in the beginning and 138.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8118.99ms. Allocated memory was 209.7MB in the beginning and 337.6MB in the end (delta: 127.9MB). Free memory was 137.4MB in the beginning and 228.3MB in the end (delta: -90.9MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Witness Printer took 7.61ms. Allocated memory is still 337.6MB. Free memory is still 227.3MB. 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 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L25-L27] double double_Array_0[2] = { 15.5, 4.625 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L28-L30] signed char signed_char_Array_0[2] = { -8, -64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -100 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {500, 8}, {256, 0} }; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] 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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] double_Array_0[0] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L91] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L94] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L97] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L100] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR unsigned_long_int_Array_0[1][1] [L40] EXPR unsigned_long_int_Array_0[1][0] [L40] EXPR unsigned_long_int_Array_0[0][0] [L40] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L40] EXPR unsigned_long_int_Array_0[0][1] [L40] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] COND TRUE unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]))) [L41] EXPR signed_char_Array_0[0] [L41] signed_char_Array_0[1] = signed_char_Array_0[0] [L53] EXPR unsigned_long_int_Array_0[0][0] [L53] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0][0]; [L54] EXPR unsigned_long_int_Array_0[1][1] [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L54] EXPR unsigned_long_int_Array_0[0][1] [L54] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=-4294967296, unsigned_long_int_Array_0={8:0}] [L54] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]))); [L55] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L55] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[0][0]) [L62] EXPR BOOL_unsigned_char_Array_0[0] [L62] unsigned char stepLocal_3 = BOOL_unsigned_char_Array_0[0]; [L63] EXPR signed_short_int_Array_0[0] [L63] EXPR signed_char_Array_0[1] [L63] signed long int stepLocal_2 = signed_short_int_Array_0[0] + signed_char_Array_0[1]; [L64] EXPR signed_char_Array_0[1] [L64] EXPR signed_char_Array_0[0] [L64] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] COND FALSE !(((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && stepLocal_3) [L75] EXPR double_Array_0[0] [L75] double_Array_0[1] = double_Array_0[0] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR ((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 [L106] EXPR ((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) [L106] EXPR unsigned_long_int_Array_0[1][1] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR unsigned_long_int_Array_0[0][0] [L106] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) [L106] EXPR unsigned_long_int_Array_0[0][1] [L106] EXPR (((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR (unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) [L106] EXPR signed_char_Array_0[1] [L106] EXPR signed_char_Array_0[0] [L106] EXPR unsigned_long_int_Array_0[1][0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] [L106] EXPR BOOL_unsigned_char_Array_0[0] [L106] EXPR ((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] [L106] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] EXPR ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106-L107] return ((((unsigned_long_int_Array_0[1][1] * ((((unsigned_long_int_Array_0[0][1]) < (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][1]) : (unsigned_long_int_Array_0[1][0])))) < unsigned_long_int_Array_0[0][0]) ? ((unsigned_long_int_Array_0[0][0] > unsigned_long_int_Array_0[1][1]) ? (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1])) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[1]))) : 1) && ((unsigned_long_int_Array_0[1][1] < (((((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) > (unsigned_long_int_Array_0[0][1])) ? ((unsigned_long_int_Array_0[1][0] * unsigned_long_int_Array_0[0][0])) : (unsigned_long_int_Array_0[0][1])))) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : ((unsigned_long_int_Array_0[0][1] < unsigned_long_int_Array_0[1][0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : (signed_char_Array_0[1] == ((signed char) -4)))))) && ((((signed_char_Array_0[1] + signed_char_Array_0[0]) == unsigned_long_int_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (((signed_short_int_Array_0[0] + signed_char_Array_0[1]) != signed_char_Array_0[0]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) : (double_Array_0[1] == ((double) double_Array_0[0]))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_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}, isInitial=1, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 794 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 5714 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4389 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1659 IncrementalHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 1325 mSDtfsCounter, 1659 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=9, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 432 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1638 NumberOfCodeBlocks, 1638 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1037 ConstructedInterpolants, 0 QuantifiedInterpolants, 2639 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1285 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3780/3780 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-14 13:27:47,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-69.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 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:27:49,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:27:49,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:27:49,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:27:49,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:27:49,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:27:49,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:27:49,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:27:49,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:27:49,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:27:49,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:27:49,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:27:49,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:27:49,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:27:49,330 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:27:49,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:27:49,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:27:49,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:27:49,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:27:49,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:27:49,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:27:49,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:27:49,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:27:49,334 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:27:49,338 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:27:49,338 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:27:49,338 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:27:49,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:27:49,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:27:49,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:27:49,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:27:49,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:27:49,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:27:49,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:27:49,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:27:49,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:27:49,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:27:49,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:27:49,340 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:27:49,340 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:27:49,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:27:49,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:27:49,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:27:49,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:27:49,341 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:27:49,341 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 -> 06557c270490180718c8b17df780a67c95f9f8a79364859de2d5e3b0ea99ce3e [2024-10-14 13:27:49,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:27:49,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:27:49,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:27:49,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:27:49,644 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:27:49,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-10-14 13:27:50,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:27:51,185 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:27:51,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-69.i [2024-10-14 13:27:51,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714e964a6/a38d97b228234f3881d02fffa6a6186e/FLAG3da310e43 [2024-10-14 13:27:51,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714e964a6/a38d97b228234f3881d02fffa6a6186e [2024-10-14 13:27:51,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:27:51,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:27:51,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:27:51,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:27:51,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:27:51,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@826e009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51, skipping insertion in model container [2024-10-14 13:27:51,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:27:51,380 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-69.i[916,929] [2024-10-14 13:27:51,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:27:51,471 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:27:51,481 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-69.i[916,929] [2024-10-14 13:27:51,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:27:51,555 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:27:51,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51 WrapperNode [2024-10-14 13:27:51,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:27:51,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:27:51,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:27:51,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:27:51,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,607 INFO L138 Inliner]: procedures = 36, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-10-14 13:27:51,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:27:51,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:27:51,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:27:51,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:27:51,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,637 INFO L175 MemorySlicer]: Split 131 memory accesses to 6 slices as follows [2, 16, 23, 31, 7, 52]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 2, 1, 4]. The 18 writes are split as follows [0, 2, 5, 5, 2, 4]. [2024-10-14 13:27:51,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:27:51,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:27:51,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:27:51,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:27:51,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (1/1) ... [2024-10-14 13:27:51,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:27:51,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:27:51,731 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-14 13:27:51,738 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-14 13:27:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:27:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 13:27:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 13:27:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-14 13:27:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-14 13:27:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-14 13:27:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-14 13:27:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 13:27:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 13:27:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-14 13:27:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-14 13:27:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-14 13:27:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-14 13:27:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:27:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:27:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 13:27:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 13:27:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-14 13:27:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-14 13:27:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 13:27:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 13:27:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-14 13:27:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-14 13:27:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-14 13:27:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-14 13:27:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:27:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:27:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 13:27:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 13:27:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-14 13:27:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-14 13:27:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:27:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:27:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 13:27:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-14 13:27:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-14 13:27:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-14 13:27:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 13:27:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 13:27:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-14 13:27:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-14 13:27:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-14 13:27:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-14 13:27:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:27:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:27:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 13:27:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 13:27:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-14 13:27:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-14 13:27:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 13:27:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 13:27:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-14 13:27:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-14 13:27:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-14 13:27:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-14 13:27:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:27:51,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:27:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:27:51,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:27:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:27:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:27:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 13:27:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-14 13:27:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-14 13:27:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-14 13:27:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 13:27:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 13:27:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-14 13:27:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-14 13:27:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-14 13:27:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-14 13:27:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:27:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:27:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 13:27:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 13:27:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-14 13:27:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-14 13:27:51,913 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:27:51,915 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:27:52,404 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-14 13:27:52,404 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:27:52,442 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:27:52,442 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:27:52,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:27:52 BoogieIcfgContainer [2024-10-14 13:27:52,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:27:52,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:27:52,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:27:52,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:27:52,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:27:51" (1/3) ... [2024-10-14 13:27:52,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1ac2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:27:52, skipping insertion in model container [2024-10-14 13:27:52,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:27:51" (2/3) ... [2024-10-14 13:27:52,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1ac2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:27:52, skipping insertion in model container [2024-10-14 13:27:52,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:27:52" (3/3) ... [2024-10-14 13:27:52,449 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-69.i [2024-10-14 13:27:52,462 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:27:52,462 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:27:52,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:27:52,523 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;@2ebc7fd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:27:52,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:27:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 13:27:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 13:27:52,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:52,540 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:52,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:52,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1533142486, now seen corresponding path program 1 times [2024-10-14 13:27:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:27:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572732350] [2024-10-14 13:27:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:52,561 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-14 13:27:52,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:27:52,564 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-14 13:27:52,583 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-14 13:27:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:52,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:27:52,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-14 13:27:52,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:27:52,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:27:52,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572732350] [2024-10-14 13:27:52,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572732350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:52,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:52,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:27:52,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876588680] [2024-10-14 13:27:52,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:52,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:27:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:27:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:27:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:27:52,888 INFO L87 Difference]: Start difference. First operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:52,929 INFO L93 Difference]: Finished difference Result 171 states and 277 transitions. [2024-10-14 13:27:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:27:52,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-14 13:27:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:52,939 INFO L225 Difference]: With dead ends: 171 [2024-10-14 13:27:52,939 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 13:27:52,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-14 13:27:52,950 INFO L432 NwaCegarLoop]: 123 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, 123 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-14 13:27:52,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:27:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 13:27:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-14 13:27:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 13:27:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-10-14 13:27:52,989 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 114 [2024-10-14 13:27:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:52,989 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-10-14 13:27:52,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:27:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-10-14 13:27:52,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 13:27:52,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:52,992 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:53,000 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 (2)] Forceful destruction successful, exit code 0 [2024-10-14 13:27:53,192 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-14 13:27:53,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:53,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1404825800, now seen corresponding path program 1 times [2024-10-14 13:27:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:27:53,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495823344] [2024-10-14 13:27:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:53,196 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-14 13:27:53,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:27:53,198 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-14 13:27:53,199 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-14 13:27:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:53,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:27:53,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:53,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:27:53,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:27:53,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495823344] [2024-10-14 13:27:53,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495823344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:53,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:53,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:27:53,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29729322] [2024-10-14 13:27:53,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:53,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:27:53,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:27:53,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:27:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:27:53,435 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:53,481 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-10-14 13:27:53,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:27:53,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-14 13:27:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:53,484 INFO L225 Difference]: With dead ends: 171 [2024-10-14 13:27:53,484 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 13:27:53,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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-14 13:27:53,485 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 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-14 13:27:53,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:27:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 13:27:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 13:27:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 13:27:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-14 13:27:53,509 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 114 [2024-10-14 13:27:53,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:53,510 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-14 13:27:53,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-14 13:27:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:27:53,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:53,512 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:53,521 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-14 13:27:53,716 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-14 13:27:53,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:53,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash -452400419, now seen corresponding path program 1 times [2024-10-14 13:27:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:27:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096537122] [2024-10-14 13:27:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:53,717 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-14 13:27:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:27:53,720 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-14 13:27:53,721 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-14 13:27:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:53,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 13:27:53,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:54,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:54,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2024-10-14 13:27:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:54,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:27:54,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:27:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096537122] [2024-10-14 13:27:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096537122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:54,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:54,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:27:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500226403] [2024-10-14 13:27:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:54,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:27:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:27:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:27:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:27:54,663 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:56,553 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2024-10-14 13:27:56,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:27:56,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-14 13:27:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:56,558 INFO L225 Difference]: With dead ends: 237 [2024-10-14 13:27:56,558 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 13:27:56,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:27:56,562 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 84 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:56,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 869 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 13:27:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 13:27:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2024-10-14 13:27:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 124 states have internal predecessors, (174), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:27:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2024-10-14 13:27:56,583 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 116 [2024-10-14 13:27:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:56,584 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2024-10-14 13:27:56,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2024-10-14 13:27:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:27:56,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:56,587 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:56,595 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-14 13:27:56,787 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-14 13:27:56,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:56,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -194234981, now seen corresponding path program 1 times [2024-10-14 13:27:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:27:56,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275206271] [2024-10-14 13:27:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:56,792 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-14 13:27:56,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:27:56,794 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-14 13:27:56,798 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-14 13:27:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:57,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 13:27:57,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:57,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:57,166 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 34 treesize of output 10 [2024-10-14 13:27:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:57,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:27:57,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:27:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275206271] [2024-10-14 13:27:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275206271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:57,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:27:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024203138] [2024-10-14 13:27:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:57,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:27:57,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:27:57,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:27:57,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:27:57,189 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:57,589 INFO L93 Difference]: Finished difference Result 354 states and 520 transitions. [2024-10-14 13:27:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:27:57,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-14 13:27:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:57,592 INFO L225 Difference]: With dead ends: 354 [2024-10-14 13:27:57,592 INFO L226 Difference]: Without dead ends: 207 [2024-10-14 13:27:57,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:27:57,594 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 88 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:57,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 452 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:27:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-14 13:27:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-10-14 13:27:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.4023668639053255) internal successors, (237), 171 states have internal predecessors, (237), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 13:27:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 299 transitions. [2024-10-14 13:27:57,610 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 299 transitions. Word has length 116 [2024-10-14 13:27:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:57,610 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 299 transitions. [2024-10-14 13:27:57,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 299 transitions. [2024-10-14 13:27:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:27:57,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:57,612 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:57,621 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 (5)] Ended with exit code 0 [2024-10-14 13:27:57,816 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-14 13:27:57,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:57,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1848422171, now seen corresponding path program 1 times [2024-10-14 13:27:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:27:57,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758791305] [2024-10-14 13:27:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:57,818 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-14 13:27:57,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:27:57,821 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-14 13:27:57,828 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-14 13:27:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:58,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 13:27:58,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:58,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:58,074 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 35 treesize of output 11 [2024-10-14 13:27:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:58,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:27:58,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:27:58,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758791305] [2024-10-14 13:27:58,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758791305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:58,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:58,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:27:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395912985] [2024-10-14 13:27:58,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:58,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:27:58,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:27:58,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:27:58,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:27:58,089 INFO L87 Difference]: Start difference. First operand 204 states and 299 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:27:58,455 INFO L93 Difference]: Finished difference Result 414 states and 602 transitions. [2024-10-14 13:27:58,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:27:58,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-14 13:27:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:27:58,458 INFO L225 Difference]: With dead ends: 414 [2024-10-14 13:27:58,458 INFO L226 Difference]: Without dead ends: 211 [2024-10-14 13:27:58,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:27:58,459 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 88 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:27:58,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 576 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:27:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-14 13:27:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2024-10-14 13:27:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 128 states have internal predecessors, (177), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:27:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-10-14 13:27:58,468 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 116 [2024-10-14 13:27:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:27:58,469 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-10-14 13:27:58,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:27:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-10-14 13:27:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 13:27:58,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:27:58,470 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:27:58,478 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-14 13:27:58,674 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-14 13:27:58,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:27:58,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:27:58,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2106587609, now seen corresponding path program 1 times [2024-10-14 13:27:58,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:27:58,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651443341] [2024-10-14 13:27:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:27:58,676 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-14 13:27:58,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:27:58,679 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-14 13:27:58,680 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-14 13:27:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:27:58,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 13:27:58,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:27:59,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:27:59,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2024-10-14 13:27:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:27:59,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:27:59,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:27:59,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651443341] [2024-10-14 13:27:59,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651443341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:27:59,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:27:59,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:27:59,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104912552] [2024-10-14 13:27:59,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:27:59,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:27:59,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:27:59,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:27:59,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:27:59,686 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:28:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:28:01,446 INFO L93 Difference]: Finished difference Result 361 states and 520 transitions. [2024-10-14 13:28:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:28:01,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-14 13:28:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:28:01,452 INFO L225 Difference]: With dead ends: 361 [2024-10-14 13:28:01,452 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 13:28:01,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:28:01,453 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 75 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:28:01,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1045 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 13:28:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 13:28:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 159. [2024-10-14 13:28:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 134 states have internal predecessors, (186), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:28:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 230 transitions. [2024-10-14 13:28:01,472 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 230 transitions. Word has length 116 [2024-10-14 13:28:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:28:01,472 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 230 transitions. [2024-10-14 13:28:01,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:28:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 230 transitions. [2024-10-14 13:28:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:28:01,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:28:01,474 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:28:01,483 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 (7)] Ended with exit code 0 [2024-10-14 13:28:01,674 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-14 13:28:01,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:28:01,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:28:01,675 INFO L85 PathProgramCache]: Analyzing trace with hash -90664594, now seen corresponding path program 1 times [2024-10-14 13:28:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:28:01,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706478291] [2024-10-14 13:28:01,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:28:01,676 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-14 13:28:01,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:28:01,677 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-14 13:28:01,678 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-14 13:28:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:28:01,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 13:28:01,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:28:01,868 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 20 treesize of output 16 [2024-10-14 13:28:01,909 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 63 treesize of output 51 [2024-10-14 13:28:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:28:01,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:28:01,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:28:01,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706478291] [2024-10-14 13:28:01,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706478291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:28:01,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:28:01,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:28:01,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459179328] [2024-10-14 13:28:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:28:01,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:28:01,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:28:01,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:28:01,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:28:01,936 INFO L87 Difference]: Start difference. First operand 159 states and 230 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:28:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:28:02,164 INFO L93 Difference]: Finished difference Result 368 states and 530 transitions. [2024-10-14 13:28:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:28:02,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-14 13:28:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:28:02,170 INFO L225 Difference]: With dead ends: 368 [2024-10-14 13:28:02,170 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 13:28:02,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 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-14 13:28:02,173 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 106 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:28:02,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 932 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:28:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 13:28:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 157. [2024-10-14 13:28:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 132 states have internal predecessors, (183), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:28:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 227 transitions. [2024-10-14 13:28:02,201 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 227 transitions. Word has length 117 [2024-10-14 13:28:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:28:02,201 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 227 transitions. [2024-10-14 13:28:02,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:28:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 227 transitions. [2024-10-14 13:28:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:28:02,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:28:02,203 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:28:02,217 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-14 13:28:02,409 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-14 13:28:02,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:28:02,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:28:02,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1350584819, now seen corresponding path program 1 times [2024-10-14 13:28:02,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:28:02,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274091188] [2024-10-14 13:28:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:28:02,411 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-14 13:28:02,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:28:02,413 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-14 13:28:02,414 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-14 13:28:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:28:02,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:28:02,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:28:02,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:28:02,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 16 [2024-10-14 13:28:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 13:28:03,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:28:03,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:28:03,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274091188] [2024-10-14 13:28:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274091188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:28:03,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:28:03,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:28:03,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606116177] [2024-10-14 13:28:03,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:28:03,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:28:03,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:28:03,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:28:03,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:28:03,093 INFO L87 Difference]: Start difference. First operand 157 states and 227 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:28:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:28:04,450 INFO L93 Difference]: Finished difference Result 448 states and 650 transitions. [2024-10-14 13:28:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:28:04,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-14 13:28:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:28:04,454 INFO L225 Difference]: With dead ends: 448 [2024-10-14 13:28:04,454 INFO L226 Difference]: Without dead ends: 292 [2024-10-14 13:28:04,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:28:04,455 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 85 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:28:04,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 474 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 13:28:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-14 13:28:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 202. [2024-10-14 13:28:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 177 states have internal predecessors, (251), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:28:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 295 transitions. [2024-10-14 13:28:04,464 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 295 transitions. Word has length 117 [2024-10-14 13:28:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:28:04,464 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 295 transitions. [2024-10-14 13:28:04,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 13:28:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 295 transitions. [2024-10-14 13:28:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 13:28:04,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:28:04,465 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:28:04,474 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-14 13:28:04,669 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-14 13:28:04,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:28:04,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:28:04,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2135035851, now seen corresponding path program 1 times [2024-10-14 13:28:04,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:28:04,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980677038] [2024-10-14 13:28:04,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:28:04,671 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-14 13:28:04,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:28:04,673 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-14 13:28:04,676 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-14 13:28:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:28:04,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 13:28:04,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:28:04,972 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 12 treesize of output 8 [2024-10-14 13:28:05,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 23 [2024-10-14 13:28:05,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:28:05,336 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 65 treesize of output 35 [2024-10-14 13:28:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 13:28:05,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:28:05,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:28:05,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980677038] [2024-10-14 13:28:05,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980677038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:28:05,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:28:05,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:28:05,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939920461] [2024-10-14 13:28:05,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:28:05,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:28:05,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:28:05,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:28:05,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:28:05,378 INFO L87 Difference]: Start difference. First operand 202 states and 295 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:28:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:28:05,729 INFO L93 Difference]: Finished difference Result 574 states and 835 transitions. [2024-10-14 13:28:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:28:05,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2024-10-14 13:28:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:28:05,731 INFO L225 Difference]: With dead ends: 574 [2024-10-14 13:28:05,731 INFO L226 Difference]: Without dead ends: 373 [2024-10-14 13:28:05,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 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-14 13:28:05,732 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 208 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:28:05,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 574 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:28:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-14 13:28:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2024-10-14 13:28:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 331 states have (on average 1.4259818731117824) internal successors, (472), 334 states have internal predecessors, (472), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 13:28:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 536 transitions. [2024-10-14 13:28:05,761 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 536 transitions. Word has length 117 [2024-10-14 13:28:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:28:05,761 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 536 transitions. [2024-10-14 13:28:05,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 13:28:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 536 transitions. [2024-10-14 13:28:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 13:28:05,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:28:05,762 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:28:05,774 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 (10)] Forceful destruction successful, exit code 0 [2024-10-14 13:28:05,963 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-14 13:28:05,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:28:05,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:28:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1614612530, now seen corresponding path program 1 times [2024-10-14 13:28:05,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:28:05,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947496673] [2024-10-14 13:28:05,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:28:05,965 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-14 13:28:05,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:28:05,968 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-14 13:28:05,969 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-14 13:28:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:28:06,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 13:28:06,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:28:06,297 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-14 13:28:06,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:28:06,949 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 172 treesize of output 98 [2024-10-14 13:28:07,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:28:07,265 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 368 treesize of output 134 [2024-10-14 13:28:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-14 13:28:07,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:28:07,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:28:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947496673] [2024-10-14 13:28:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947496673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:28:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1231509291] [2024-10-14 13:28:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:28:07,761 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:28:07,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:28:07,764 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:28:07,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-14 13:28:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:28:08,012 WARN L253 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-10-14 13:28:08,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:28:08,191 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 12 treesize of output 8 [2024-10-14 13:28:09,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-14 13:28:10,178 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-14 13:28:11,216 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 12 treesize of output 8 [2024-10-14 13:28:12,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:28:13,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:28:14,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:28:16,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:28:17,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-14 13:28:18,622 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 122 treesize of output 80 [2024-10-14 13:28:19,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2024-10-14 13:28:19,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-10-14 13:28:20,170 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 0 case distinctions, treesize of input 282 treesize of output 122 [2024-10-14 13:28:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 56 proven. 179 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-10-14 13:28:20,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:28:21,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1231509291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:28:21,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:28:21,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 34] total 40 [2024-10-14 13:28:21,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740643553] [2024-10-14 13:28:21,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:28:21,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 13:28:21,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:28:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 13:28:21,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2024-10-14 13:28:21,324 INFO L87 Difference]: Start difference. First operand 369 states and 536 transitions. Second operand has 41 states, 26 states have (on average 4.115384615384615) internal successors, (107), 40 states have internal predecessors, (107), 17 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (30), 6 states have call predecessors, (30), 17 states have call successors, (30) [2024-10-14 13:28:51,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:28:57,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:29:01,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:29:06,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]