./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:35:49,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:35:49,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:35:49,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:35:49,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:35:49,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:35:49,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:35:49,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:35:49,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:35:49,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:35:49,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:35:49,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:35:49,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:35:49,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:35:49,574 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:35:49,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:35:49,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:35:49,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:35:49,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:35:49,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:35:49,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:35:49,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:35:49,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:35:49,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:35:49,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:35:49,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:35:49,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:35:49,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:35:49,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:35:49,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:35:49,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:35:49,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:35:49,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:35:49,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:35:49,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:35:49,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:35:49,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:35:49,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:35:49,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:35:49,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:35:49,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:35:49,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:35:49,588 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-clean/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-clean/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 -> 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 [2024-10-11 13:35:49,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:35:49,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:35:49,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:35:49,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:35:49,850 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:35:49,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2024-10-11 13:35:51,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:35:51,491 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:35:51,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2024-10-11 13:35:51,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/35b6e34f5/095e9c9e996e4f0184f9a300b700a990/FLAGe107c4dfa [2024-10-11 13:35:51,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/35b6e34f5/095e9c9e996e4f0184f9a300b700a990 [2024-10-11 13:35:51,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:35:51,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:35:51,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:35:51,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:35:51,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:35:51,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:35:51" (1/1) ... [2024-10-11 13:35:51,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fea939b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:51, skipping insertion in model container [2024-10-11 13:35:51,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:35:51" (1/1) ... [2024-10-11 13:35:51,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:35:52,082 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2024-10-11 13:35:52,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:35:52,147 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:35:52,157 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2024-10-11 13:35:52,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:35:52,200 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:35:52,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52 WrapperNode [2024-10-11 13:35:52,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:35:52,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:35:52,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:35:52,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:35:52,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,254 INFO L138 Inliner]: procedures = 29, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-10-11 13:35:52,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:35:52,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:35:52,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:35:52,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:35:52,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,301 INFO L175 MemorySlicer]: Split 91 memory accesses to 10 slices as follows [2, 19, 6, 12, 12, 10, 8, 6, 8, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 2, 1, 1, 1, 1, 2, 1, 1]. [2024-10-11 13:35:52,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:35:52,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:35:52,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:35:52,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:35:52,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (1/1) ... [2024-10-11 13:35:52,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:35:52,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:35:52,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:35:52,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:35:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:35:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:35:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:35:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:35:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:35:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:35:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:35:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:35:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:35:52,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:35:52,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:35:52,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:35:52,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:35:52,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:35:52,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:35:52,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:35:52,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:35:52,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:35:52,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:35:52,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:35:52,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:35:52,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:35:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:35:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:35:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:35:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:35:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:35:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:35:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:35:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:35:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:35:52,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:35:52,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:35:52,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:35:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:35:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:35:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:35:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:35:52,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:35:52,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:35:52,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:35:52,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:35:52,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:35:52,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:35:52,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:35:52,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:35:52,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:35:52,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:35:52,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:35:52,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:35:52,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:35:52,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:35:52,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:35:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:35:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:35:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:35:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:35:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:35:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:35:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:35:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:35:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:35:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:35:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:35:52,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:35:52,628 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:35:52,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:35:53,042 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-11 13:35:53,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:35:53,077 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:35:53,078 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:35:53,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:35:53 BoogieIcfgContainer [2024-10-11 13:35:53,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:35:53,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:35:53,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:35:53,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:35:53,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:35:51" (1/3) ... [2024-10-11 13:35:53,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b936248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:35:53, skipping insertion in model container [2024-10-11 13:35:53,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:35:52" (2/3) ... [2024-10-11 13:35:53,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b936248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:35:53, skipping insertion in model container [2024-10-11 13:35:53,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:35:53" (3/3) ... [2024-10-11 13:35:53,086 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-21.i [2024-10-11 13:35:53,098 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:35:53,098 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:35:53,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:35:53,173 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;@1d0c45c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:35:53,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:35:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 13:35:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:35:53,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:53,190 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:53,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:53,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:53,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1647384108, now seen corresponding path program 1 times [2024-10-11 13:35:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774604027] [2024-10-11 13:35:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:35:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:53,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:53,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:35:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:35:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:35:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:35:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774604027] [2024-10-11 13:35:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774604027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:53,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:35:53,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894344496] [2024-10-11 13:35:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:53,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:35:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:53,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:35:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:35:53,598 INFO L87 Difference]: Start difference. First operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 13:35:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:53,633 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2024-10-11 13:35:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:35:53,638 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2024-10-11 13:35:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:53,646 INFO L225 Difference]: With dead ends: 175 [2024-10-11 13:35:53,646 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 13:35:53,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-11 13:35:53,651 INFO L432 NwaCegarLoop]: 126 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, 126 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-11 13:35:53,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:35:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 13:35:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 13:35:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 78 states have internal predecessors, (116), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 13:35:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-10-11 13:35:53,691 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 75 [2024-10-11 13:35:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:53,691 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-10-11 13:35:53,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 13:35:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-10-11 13:35:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:35:53,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:53,695 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:53,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:35:53,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:53,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:53,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1170950670, now seen corresponding path program 1 times [2024-10-11 13:35:53,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:53,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85293279] [2024-10-11 13:35:53,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:53,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:35:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:35:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:35:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:35:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:35:54,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:54,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85293279] [2024-10-11 13:35:54,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85293279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:54,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:54,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:35:54,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925675341] [2024-10-11 13:35:54,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:54,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:35:54,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:35:54,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:35:54,451 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:54,646 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2024-10-11 13:35:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:35:54,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2024-10-11 13:35:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:54,653 INFO L225 Difference]: With dead ends: 289 [2024-10-11 13:35:54,653 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 13:35:54,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:35:54,654 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 232 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:54,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 667 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:35:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 13:35:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 177. [2024-10-11 13:35:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.4625) internal successors, (234), 160 states have internal predecessors, (234), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:35:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2024-10-11 13:35:54,689 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 75 [2024-10-11 13:35:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:54,689 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2024-10-11 13:35:54,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2024-10-11 13:35:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 13:35:54,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:54,691 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:35:54,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:54,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2088746051, now seen corresponding path program 1 times [2024-10-11 13:35:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:54,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745657656] [2024-10-11 13:35:54,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:54,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:35:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:35:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:35:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:35:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:35:54,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745657656] [2024-10-11 13:35:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745657656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:54,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:35:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740304212] [2024-10-11 13:35:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:54,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:35:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:35:54,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:35:54,858 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:54,907 INFO L93 Difference]: Finished difference Result 356 states and 527 transitions. [2024-10-11 13:35:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:35:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 78 [2024-10-11 13:35:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:54,910 INFO L225 Difference]: With dead ends: 356 [2024-10-11 13:35:54,910 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 13:35:54,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:35:54,912 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:54,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:35:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 13:35:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-11 13:35:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.4478527607361964) internal successors, (236), 163 states have internal predecessors, (236), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:35:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions. [2024-10-11 13:35:54,931 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 78 [2024-10-11 13:35:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:54,931 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions. [2024-10-11 13:35:54,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2024-10-11 13:35:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 13:35:54,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:54,933 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:54,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:35:54,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:54,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1731782028, now seen corresponding path program 1 times [2024-10-11 13:35:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:54,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195629086] [2024-10-11 13:35:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:54,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:35:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:35:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:35:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:35:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:35:55,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195629086] [2024-10-11 13:35:55,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195629086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:55,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:55,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:35:55,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186057029] [2024-10-11 13:35:55,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:35:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:55,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:35:55,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:35:55,375 INFO L87 Difference]: Start difference. First operand 180 states and 264 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:55,521 INFO L93 Difference]: Finished difference Result 475 states and 688 transitions. [2024-10-11 13:35:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:35:55,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 82 [2024-10-11 13:35:55,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:55,524 INFO L225 Difference]: With dead ends: 475 [2024-10-11 13:35:55,526 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 13:35:55,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:35:55,528 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:55,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 870 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:35:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 13:35:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-10-11 13:35:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 267 states have (on average 1.4232209737827715) internal successors, (380), 269 states have internal predecessors, (380), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:35:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2024-10-11 13:35:55,563 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 82 [2024-10-11 13:35:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:55,564 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2024-10-11 13:35:55,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2024-10-11 13:35:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:35:55,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:55,569 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:55,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:35:55,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:55,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:55,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1507292681, now seen corresponding path program 1 times [2024-10-11 13:35:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39751265] [2024-10-11 13:35:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:35:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:35:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:35:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:35:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:35:55,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:55,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39751265] [2024-10-11 13:35:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39751265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:55,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:55,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:35:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873514125] [2024-10-11 13:35:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:55,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:35:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:55,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:35:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:35:55,800 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:55,862 INFO L93 Difference]: Finished difference Result 306 states and 437 transitions. [2024-10-11 13:35:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:35:55,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-11 13:35:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:55,867 INFO L225 Difference]: With dead ends: 306 [2024-10-11 13:35:55,867 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 13:35:55,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:35:55,870 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:55,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 718 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:35:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 13:35:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-10-11 13:35:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 281 states have internal predecessors, (392), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:35:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 432 transitions. [2024-10-11 13:35:55,894 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 432 transitions. Word has length 84 [2024-10-11 13:35:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:55,894 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 432 transitions. [2024-10-11 13:35:55,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 432 transitions. [2024-10-11 13:35:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:35:55,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:55,896 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:55,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:35:55,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:55,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:55,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1768933794, now seen corresponding path program 1 times [2024-10-11 13:35:55,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:55,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606138676] [2024-10-11 13:35:55,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:55,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:35:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:35:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:35:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:35:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:35:55,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:55,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606138676] [2024-10-11 13:35:55,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606138676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:55,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:35:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147740540] [2024-10-11 13:35:55,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:55,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:35:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:35:55,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:35:55,982 INFO L87 Difference]: Start difference. First operand 304 states and 432 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:56,010 INFO L93 Difference]: Finished difference Result 610 states and 869 transitions. [2024-10-11 13:35:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:35:56,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-11 13:35:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:56,014 INFO L225 Difference]: With dead ends: 610 [2024-10-11 13:35:56,014 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 13:35:56,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:35:56,016 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:56,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:35:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 13:35:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-10-11 13:35:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 282 states have (on average 1.400709219858156) internal successors, (395), 284 states have internal predecessors, (395), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:35:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 435 transitions. [2024-10-11 13:35:56,033 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 435 transitions. Word has length 84 [2024-10-11 13:35:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:56,034 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 435 transitions. [2024-10-11 13:35:56,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 435 transitions. [2024-10-11 13:35:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 13:35:56,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:56,036 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:56,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:35:56,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:56,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1504965148, now seen corresponding path program 1 times [2024-10-11 13:35:56,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:56,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544782037] [2024-10-11 13:35:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:35:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:35:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:56,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:56,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:35:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:56,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:35:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:56,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:35:56,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:56,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544782037] [2024-10-11 13:35:56,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544782037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:56,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:56,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:35:56,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37666939] [2024-10-11 13:35:56,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:56,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:35:56,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:56,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:35:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:35:56,586 INFO L87 Difference]: Start difference. First operand 307 states and 435 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:57,022 INFO L93 Difference]: Finished difference Result 1214 states and 1727 transitions. [2024-10-11 13:35:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:35:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-11 13:35:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:57,029 INFO L225 Difference]: With dead ends: 1214 [2024-10-11 13:35:57,029 INFO L226 Difference]: Without dead ends: 908 [2024-10-11 13:35:57,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:35:57,032 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 483 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:57,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1416 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:35:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-10-11 13:35:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 615. [2024-10-11 13:35:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 566 states have (on average 1.4063604240282686) internal successors, (796), 570 states have internal predecessors, (796), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:35:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 876 transitions. [2024-10-11 13:35:57,071 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 876 transitions. Word has length 84 [2024-10-11 13:35:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:57,072 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 876 transitions. [2024-10-11 13:35:57,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 876 transitions. [2024-10-11 13:35:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:35:57,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:57,073 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:57,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:35:57,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:57,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 584576232, now seen corresponding path program 1 times [2024-10-11 13:35:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:57,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374937013] [2024-10-11 13:35:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:35:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:35:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:35:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:35:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:35:57,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:57,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374937013] [2024-10-11 13:35:57,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374937013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:57,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:57,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:35:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169601163] [2024-10-11 13:35:57,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:57,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:35:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:35:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:35:57,266 INFO L87 Difference]: Start difference. First operand 615 states and 876 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:57,402 INFO L93 Difference]: Finished difference Result 1592 states and 2266 transitions. [2024-10-11 13:35:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:35:57,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-11 13:35:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:57,409 INFO L225 Difference]: With dead ends: 1592 [2024-10-11 13:35:57,409 INFO L226 Difference]: Without dead ends: 978 [2024-10-11 13:35:57,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:35:57,411 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 186 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:57,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 571 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:35:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-11 13:35:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 932. [2024-10-11 13:35:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 859 states have (on average 1.3958090803259604) internal successors, (1199), 865 states have internal predecessors, (1199), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:35:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1319 transitions. [2024-10-11 13:35:57,460 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1319 transitions. Word has length 85 [2024-10-11 13:35:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1319 transitions. [2024-10-11 13:35:57,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1319 transitions. [2024-10-11 13:35:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:35:57,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:57,461 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:57,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:35:57,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:57,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash 455287976, now seen corresponding path program 1 times [2024-10-11 13:35:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:57,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389083110] [2024-10-11 13:35:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:35:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:35:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:35:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:35:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:35:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:35:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:35:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:35:57,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:35:57,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389083110] [2024-10-11 13:35:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389083110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:57,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:57,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:35:57,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156559385] [2024-10-11 13:35:57,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:57,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:35:57,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:35:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:35:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:35:57,661 INFO L87 Difference]: Start difference. First operand 932 states and 1319 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:57,769 INFO L93 Difference]: Finished difference Result 1879 states and 2651 transitions. [2024-10-11 13:35:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:35:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-11 13:35:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:57,775 INFO L225 Difference]: With dead ends: 1879 [2024-10-11 13:35:57,775 INFO L226 Difference]: Without dead ends: 969 [2024-10-11 13:35:57,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:35:57,779 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:57,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 834 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:35:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-10-11 13:35:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 951. [2024-10-11 13:35:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 878 states have (on average 1.3861047835990887) internal successors, (1217), 884 states have internal predecessors, (1217), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:35:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1337 transitions. [2024-10-11 13:35:57,837 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1337 transitions. Word has length 85 [2024-10-11 13:35:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:57,838 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1337 transitions. [2024-10-11 13:35:57,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:35:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1337 transitions. [2024-10-11 13:35:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:35:57,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:57,839 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:35:57,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:35:57,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1190243658, now seen corresponding path program 1 times [2024-10-11 13:35:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:35:57,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626849568] [2024-10-11 13:35:57,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:57,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:35:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:35:57,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156992389] [2024-10-11 13:35:57,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:57,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:35:57,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:35:57,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:35:57,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:35:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:35:58,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:35:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:35:58,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:35:58,414 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:35:58,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:35:58,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:35:58,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 13:35:58,625 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:35:58,774 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:35:58,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:35:58 BoogieIcfgContainer [2024-10-11 13:35:58,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:35:58,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:35:58,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:35:58,779 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:35:58,779 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:35:53" (3/4) ... [2024-10-11 13:35:58,781 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:35:58,782 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:35:58,783 INFO L158 Benchmark]: Toolchain (without parser) took 6907.26ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 116.1MB in the beginning and 122.5MB in the end (delta: -6.4MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2024-10-11 13:35:58,783 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:35:58,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.58ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 101.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:35:58,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.98ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 98.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:35:58,784 INFO L158 Benchmark]: Boogie Preprocessor took 79.57ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 93.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:35:58,784 INFO L158 Benchmark]: RCFGBuilder took 743.64ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 54.7MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 13:35:58,785 INFO L158 Benchmark]: TraceAbstraction took 5697.19ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 54.0MB in the beginning and 123.6MB in the end (delta: -69.5MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-10-11 13:35:58,785 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 251.7MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:35:58,787 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.58ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 101.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.98ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 98.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.57ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 93.1MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 743.64ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 54.7MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5697.19ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 54.0MB in the beginning and 123.6MB in the end (delta: -69.5MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 251.7MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L22] unsigned short int var_1_1 = 32; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_7 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned char* var_1_7_Pointer = &(var_1_7); [L26] double var_1_8 = 15.6; [L26] double var_1_8 = 15.6; [L27] double* var_1_8_Pointer = &(var_1_8); [L28] double var_1_9 = 15.4; [L28] double var_1_9 = 15.4; [L29] double* var_1_9_Pointer = &(var_1_9); [L30] double var_1_10 = 32.2; [L30] double var_1_10 = 32.2; [L31] double* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_12 = 1; [L32] unsigned char var_1_12 = 1; [L33] unsigned char* var_1_12_Pointer = &(var_1_12); [L34] signed short int var_1_13 = 256; [L34] signed short int var_1_13 = 256; [L35] signed short int* var_1_13_Pointer = &(var_1_13); [L36] float var_1_14 = 5.75; [L36] float var_1_14 = 5.75; [L37] float* var_1_14_Pointer = &(var_1_14); [L38] float var_1_15 = 8.6; [L38] float var_1_15 = 8.6; [L39] float* var_1_15_Pointer = &(var_1_15); [L40] unsigned char last_1_var_1_7 = 0; [L41] signed short int last_1_var_1_13 = 256; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L85] EXPR \read(var_1_7) [L85] last_1_var_1_7 = var_1_7 [L86] EXPR \read(var_1_13) [L86] last_1_var_1_13 = var_1_13 [L96] RET updateLastVariables() [L97] CALL updateVariables() [L70] var_1_8 = __VERIFIER_nondet_double() [L71] EXPR \read(var_1_8) [L71] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F [L71] EXPR \read(var_1_8) [L71] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L71] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L72] var_1_9 = __VERIFIER_nondet_double() [L73] EXPR \read(var_1_9) [L73] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F [L73] EXPR \read(var_1_9) [L73] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L74] var_1_10 = __VERIFIER_nondet_double() [L75] EXPR \read(var_1_10) [L75] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F [L75] EXPR \read(var_1_10) [L75] EXPR var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] EXPR (var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] var_1_14 = __VERIFIER_nondet_float() [L80] EXPR \read(var_1_14) [L80] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L80] EXPR \read(var_1_14) [L80] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] var_1_15 = __VERIFIER_nondet_float() [L82] EXPR \read(var_1_15) [L82] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L82] EXPR \read(var_1_15) [L82] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] RET updateVariables() [L98] CALL step() [L45] COND TRUE (last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L46] COND FALSE !(last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L54] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L54] COND TRUE (*(var_1_12_Pointer)) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR \read(*var_1_15_Pointer) [L55] EXPR \read(*var_1_8_Pointer) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L55] COND FALSE !(((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) [L58] EXPR \read(*var_1_1_Pointer) [L58] (*(var_1_13_Pointer)) = (*(var_1_1_Pointer)) [L61] EXPR \read(*var_1_8_Pointer) [L61] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L61] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) [L61] EXPR \read(*var_1_8_Pointer) [L61] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L61] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L61] COND TRUE (((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer)) [L62] last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L62] last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L62] COND FALSE !(last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1 [L89] EXPR (last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) [L89] EXPR \read(*var_1_8_Pointer) [L89] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) [L89] EXPR \read(*var_1_8_Pointer) [L89] EXPR (((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) [L89] EXPR \read(*var_1_7_Pointer) [L89] EXPR \read(*var_1_12_Pointer) [L89] EXPR ((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed short int) (((((*(var_1_1_Pointer))) > ((*(var_1_1_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_1_Pointer))))))) : ((*(var_1_13_Pointer)) == ((signed short int) (*(var_1_1_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed short int) (((((*(var_1_1_Pointer))) > ((*(var_1_1_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_1_Pointer))))))) : ((*(var_1_13_Pointer)) == ((signed short int) (*(var_1_1_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89-L90] return ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : ((*(var_1_1_Pointer)) == ((unsigned short int) last_1_var_1_13))) && (((((((*(var_1_8_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_9_Pointer))))) <= (*(var_1_10_Pointer))) ? ((last_1_var_1_7 && ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)))) ? ((*(var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(var_1_7_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((*(var_1_12_Pointer)) ? ((((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) >= (((*(var_1_8_Pointer)) + (*(var_1_10_Pointer))) + (*(var_1_9_Pointer)))) ? ((*(var_1_13_Pointer)) == ((signed short int) (((((*(var_1_1_Pointer))) > ((*(var_1_1_Pointer)))) ? ((*(var_1_1_Pointer))) : ((*(var_1_1_Pointer))))))) : ((*(var_1_13_Pointer)) == ((signed short int) (*(var_1_1_Pointer))))) : 1) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 972 mSDsluCounter, 5930 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4670 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 682 IncrementalHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 1260 mSDtfsCounter, 682 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=9, InterpolantAutomatonStates: 57, 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, 387 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 723 ConstructedInterpolants, 0 QuantifiedInterpolants, 1654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 756/756 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-11 13:35:58,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:36:01,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:36:01,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:36:01,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:36:01,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:36:01,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:36:01,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:36:01,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:36:01,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:36:01,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:36:01,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:36:01,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:36:01,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:36:01,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:36:01,156 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:36:01,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:36:01,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:36:01,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:36:01,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:36:01,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:36:01,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:36:01,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:36:01,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:36:01,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:36:01,159 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:36:01,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:36:01,160 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:36:01,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:36:01,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:36:01,161 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:36:01,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:36:01,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:36:01,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:36:01,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:36:01,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:01,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:36:01,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:36:01,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:36:01,164 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:36:01,165 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:36:01,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:36:01,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:36:01,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:36:01,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:36:01,166 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:36:01,166 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-clean/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-clean/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 -> 1cca72686861ad5f32c03321c83cb01c79fc9fe11e27ec52efe74f8c4ef5e302 [2024-10-11 13:36:01,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:36:01,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:36:01,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:36:01,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:36:01,530 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:36:01,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2024-10-11 13:36:03,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:36:03,242 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:36:03,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i [2024-10-11 13:36:03,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/889166530/03b78743b5d84564aeab2327c61c3557/FLAGb176528ee [2024-10-11 13:36:03,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/889166530/03b78743b5d84564aeab2327c61c3557 [2024-10-11 13:36:03,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:36:03,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:36:03,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:03,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:36:03,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:36:03,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c5acaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03, skipping insertion in model container [2024-10-11 13:36:03,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:36:03,524 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2024-10-11 13:36:03,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:03,617 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:36:03,630 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-21.i[916,929] [2024-10-11 13:36:03,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:36:03,689 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:36:03,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03 WrapperNode [2024-10-11 13:36:03,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:36:03,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:03,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:36:03,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:36:03,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,756 INFO L138 Inliner]: procedures = 36, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-10-11 13:36:03,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:36:03,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:36:03,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:36:03,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:36:03,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,806 INFO L175 MemorySlicer]: Split 91 memory accesses to 10 slices as follows [2, 19, 6, 12, 12, 10, 8, 6, 8, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 2, 1, 1, 1, 1, 2, 1, 1]. [2024-10-11 13:36:03,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:36:03,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:36:03,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:36:03,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:36:03,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (1/1) ... [2024-10-11 13:36:03,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:36:03,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:36:03,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:36:03,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:36:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:36:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:36:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:36:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:36:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:36:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:36:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-11 13:36:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-11 13:36:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-11 13:36:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-11 13:36:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-11 13:36:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:36:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:36:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:36:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:36:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:36:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-11 13:36:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-11 13:36:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-11 13:36:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-11 13:36:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-11 13:36:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:36:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:36:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:36:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:36:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:36:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:36:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:36:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:36:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:36:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:36:03,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:36:03,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:36:03,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:36:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:36:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:36:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:36:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:36:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:36:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:36:03,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:36:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:36:03,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:36:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-11 13:36:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-11 13:36:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-11 13:36:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-11 13:36:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-11 13:36:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:36:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:36:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:36:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:36:03,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:36:03,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:36:03,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:36:03,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:36:03,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:36:03,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:36:03,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:36:03,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:36:03,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:36:03,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:36:03,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:36:03,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:36:03,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:36:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:36:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:36:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:36:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:36:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:36:03,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:36:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:36:03,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:36:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:36:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:36:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:36:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:36:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:36:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:36:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:36:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:36:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:36:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:36:04,206 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:36:04,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:36:12,819 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-11 13:36:12,819 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:36:12,864 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:36:12,864 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:36:12,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:12 BoogieIcfgContainer [2024-10-11 13:36:12,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:36:12,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:36:12,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:36:12,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:36:12,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:36:03" (1/3) ... [2024-10-11 13:36:12,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c38f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:12, skipping insertion in model container [2024-10-11 13:36:12,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:36:03" (2/3) ... [2024-10-11 13:36:12,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c38f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:36:12, skipping insertion in model container [2024-10-11 13:36:12,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:36:12" (3/3) ... [2024-10-11 13:36:12,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-21.i [2024-10-11 13:36:12,893 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:36:12,893 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:36:12,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:36:12,959 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;@3bee8864, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:36:12,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:36:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 13:36:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:36:12,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:12,972 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:12,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:12,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:12,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1647384108, now seen corresponding path program 1 times [2024-10-11 13:36:12,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805860165] [2024-10-11 13:36:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:12,994 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-11 13:36:12,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:12,997 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:36:13,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:13,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:36:13,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 13:36:13,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:13,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:13,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805860165] [2024-10-11 13:36:13,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805860165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:13,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:36:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393885727] [2024-10-11 13:36:13,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:13,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:36:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:13,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:36:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:36:13,448 INFO L87 Difference]: Start difference. First operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:13,507 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2024-10-11 13:36:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:36:13,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2024-10-11 13:36:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:13,516 INFO L225 Difference]: With dead ends: 175 [2024-10-11 13:36:13,517 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 13:36:13,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-11 13:36:13,523 INFO L432 NwaCegarLoop]: 126 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, 126 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-11 13:36:13,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:36:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 13:36:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 13:36:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 78 states have internal predecessors, (116), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 13:36:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-10-11 13:36:13,566 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 75 [2024-10-11 13:36:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:13,567 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-10-11 13:36:13,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-10-11 13:36:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:36:13,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:13,570 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:13,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:13,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:36:13,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:13,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1170950670, now seen corresponding path program 1 times [2024-10-11 13:36:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:13,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379591894] [2024-10-11 13:36:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:13,773 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-11 13:36:13,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:13,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:36:13,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:14,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:36:14,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:14,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:36:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:36:14,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:14,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:14,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379591894] [2024-10-11 13:36:14,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379591894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:14,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:14,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:36:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040139827] [2024-10-11 13:36:14,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:14,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:36:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:14,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:36:14,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:36:14,509 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:16,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:36:18,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:36:21,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:36:23,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:36:26,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:36:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:26,908 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2024-10-11 13:36:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:36:26,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2024-10-11 13:36:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:26,913 INFO L225 Difference]: With dead ends: 289 [2024-10-11 13:36:26,913 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 13:36:26,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:26,916 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 217 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:26,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 352 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2024-10-11 13:36:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 13:36:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 177. [2024-10-11 13:36:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.4625) internal successors, (234), 160 states have internal predecessors, (234), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2024-10-11 13:36:26,942 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 75 [2024-10-11 13:36:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:26,943 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2024-10-11 13:36:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2024-10-11 13:36:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 13:36:26,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:26,949 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:26,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:27,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:36:27,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:27,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2088746051, now seen corresponding path program 1 times [2024-10-11 13:36:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306510568] [2024-10-11 13:36:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:27,152 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-11 13:36:27,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:27,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:36:27,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:27,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:36:27,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:28,830 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 27 treesize of output 15 [2024-10-11 13:36:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 13:36:28,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:30,023 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:36:30,024 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 30 treesize of output 25 [2024-10-11 13:36:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-11 13:36:30,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306510568] [2024-10-11 13:36:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306510568] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:36:30,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:36:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-10-11 13:36:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262736149] [2024-10-11 13:36:30,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:36:30,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 13:36:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:30,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 13:36:30,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:36:30,297 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 21 states, 17 states have (on average 4.647058823529412) internal successors, (79), 19 states have internal predecessors, (79), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 13:36:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:31,655 INFO L93 Difference]: Finished difference Result 339 states and 491 transitions. [2024-10-11 13:36:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:36:31,657 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.647058823529412) internal successors, (79), 19 states have internal predecessors, (79), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 78 [2024-10-11 13:36:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:31,660 INFO L225 Difference]: With dead ends: 339 [2024-10-11 13:36:31,661 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 13:36:31,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:36:31,666 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 508 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:31,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 945 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:36:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 13:36:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-11 13:36:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.408450704225352) internal successors, (200), 142 states have internal predecessors, (200), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 228 transitions. [2024-10-11 13:36:31,689 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 228 transitions. Word has length 78 [2024-10-11 13:36:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:31,689 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 228 transitions. [2024-10-11 13:36:31,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.647058823529412) internal successors, (79), 19 states have internal predecessors, (79), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 13:36:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 228 transitions. [2024-10-11 13:36:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 13:36:31,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:31,695 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:31,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:36:31,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 13:36:31,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1279428245, now seen corresponding path program 1 times [2024-10-11 13:36:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599459667] [2024-10-11 13:36:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:31,897 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-11 13:36:31,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:31,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 13:36:31,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:32,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:36:32,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:36:32,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:32,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:32,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599459667] [2024-10-11 13:36:32,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599459667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:32,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:32,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:36:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784073214] [2024-10-11 13:36:32,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:32,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:32,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:32,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:32,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:32,357 INFO L87 Difference]: Start difference. First operand 163 states and 228 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:32,561 INFO L93 Difference]: Finished difference Result 260 states and 366 transitions. [2024-10-11 13:36:32,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:32,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2024-10-11 13:36:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:32,563 INFO L225 Difference]: With dead ends: 260 [2024-10-11 13:36:32,563 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 13:36:32,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:32,564 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:32,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:36:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 13:36:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-11 13:36:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.4) internal successors, (203), 145 states have internal predecessors, (203), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:36:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 231 transitions. [2024-10-11 13:36:32,595 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 231 transitions. Word has length 79 [2024-10-11 13:36:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:32,600 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 231 transitions. [2024-10-11 13:36:32,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 231 transitions. [2024-10-11 13:36:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 13:36:32,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:32,601 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:32,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:32,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 13:36:32,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:32,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1458948386, now seen corresponding path program 1 times [2024-10-11 13:36:32,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:32,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932866684] [2024-10-11 13:36:32,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:32,803 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-11 13:36:32,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:32,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 13:36:32,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:33,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:36:33,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:34,174 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 17 treesize of output 13 [2024-10-11 13:36:34,374 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 54 treesize of output 42 [2024-10-11 13:36:34,383 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 39 [2024-10-11 13:36:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 13:36:34,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:36:34,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:34,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932866684] [2024-10-11 13:36:34,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932866684] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:36:34,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:36:34,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-10-11 13:36:34,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85063032] [2024-10-11 13:36:34,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:34,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:36:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:36:34,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:36:34,670 INFO L87 Difference]: Start difference. First operand 166 states and 231 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:34,940 INFO L93 Difference]: Finished difference Result 326 states and 455 transitions. [2024-10-11 13:36:34,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:36:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-10-11 13:36:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:34,942 INFO L225 Difference]: With dead ends: 326 [2024-10-11 13:36:34,942 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 13:36:34,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:36:34,944 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 71 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:34,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 731 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:36:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 13:36:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-10-11 13:36:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.3980099502487562) internal successors, (281), 202 states have internal predecessors, (281), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:36:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 315 transitions. [2024-10-11 13:36:34,973 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 315 transitions. Word has length 83 [2024-10-11 13:36:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:34,974 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 315 transitions. [2024-10-11 13:36:34,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 315 transitions. [2024-10-11 13:36:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:36:34,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:34,976 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:34,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:35,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 13:36:35,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:35,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:35,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1192571191, now seen corresponding path program 1 times [2024-10-11 13:36:35,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:35,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271994631] [2024-10-11 13:36:35,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:35,178 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-11 13:36:35,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:35,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 13:36:35,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:35,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:36:35,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:36,610 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 27 treesize of output 15 [2024-10-11 13:36:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 13:36:36,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:37,360 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:36:37,360 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 30 treesize of output 25 [2024-10-11 13:36:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-11 13:36:37,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:37,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271994631] [2024-10-11 13:36:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271994631] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:36:37,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:36:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-10-11 13:36:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855573154] [2024-10-11 13:36:37,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:36:37,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 13:36:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 13:36:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:36:37,543 INFO L87 Difference]: Start difference. First operand 226 states and 315 transitions. Second operand has 21 states, 17 states have (on average 6.117647058823529) internal successors, (104), 19 states have internal predecessors, (104), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 13:36:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:38,537 INFO L93 Difference]: Finished difference Result 380 states and 533 transitions. [2024-10-11 13:36:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:36:38,538 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 6.117647058823529) internal successors, (104), 19 states have internal predecessors, (104), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 85 [2024-10-11 13:36:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:38,542 INFO L225 Difference]: With dead ends: 380 [2024-10-11 13:36:38,542 INFO L226 Difference]: Without dead ends: 226 [2024-10-11 13:36:38,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:36:38,543 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 291 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:38,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 942 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:36:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-11 13:36:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-10-11 13:36:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 202 states have internal predecessors, (279), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:36:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 313 transitions. [2024-10-11 13:36:38,570 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 313 transitions. Word has length 85 [2024-10-11 13:36:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:38,570 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 313 transitions. [2024-10-11 13:36:38,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 6.117647058823529) internal successors, (104), 19 states have internal predecessors, (104), 7 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 13:36:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 313 transitions. [2024-10-11 13:36:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:36:38,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:38,575 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:38,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 13:36:38,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-11 13:36:38,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:38,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2083655284, now seen corresponding path program 1 times [2024-10-11 13:36:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:38,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049479374] [2024-10-11 13:36:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:38,777 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-11 13:36:38,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:38,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 13:36:38,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:39,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:36:39,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:39,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:36:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:36:39,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:36:39,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049479374] [2024-10-11 13:36:39,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049479374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:36:39,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:36:39,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:36:39,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890802549] [2024-10-11 13:36:39,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:39,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:39,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:39,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:36:39,411 INFO L87 Difference]: Start difference. First operand 226 states and 313 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:39,654 INFO L93 Difference]: Finished difference Result 517 states and 718 transitions. [2024-10-11 13:36:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:36:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-11 13:36:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:39,658 INFO L225 Difference]: With dead ends: 517 [2024-10-11 13:36:39,658 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 13:36:39,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:36:39,662 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 193 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:39,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 559 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:36:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 13:36:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 322. [2024-10-11 13:36:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 287 states have (on average 1.3832752613240418) internal successors, (397), 288 states have internal predecessors, (397), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:36:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 445 transitions. [2024-10-11 13:36:39,684 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 445 transitions. Word has length 85 [2024-10-11 13:36:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:39,685 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 445 transitions. [2024-10-11 13:36:39,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 445 transitions. [2024-10-11 13:36:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:36:39,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:39,689 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:39,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:39,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-11 13:36:39,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:39,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1190243658, now seen corresponding path program 1 times [2024-10-11 13:36:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:39,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68986030] [2024-10-11 13:36:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:39,891 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-11 13:36:39,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:39,894 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 13:36:39,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:40,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 13:36:40,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:46,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:36:46,282 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 1 case distinctions, treesize of input 198 treesize of output 102 [2024-10-11 13:36:46,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:36:46,572 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 1 case distinctions, treesize of input 135 treesize of output 63 [2024-10-11 13:36:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 13:36:46,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:36:48,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:48,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68986030] [2024-10-11 13:36:48,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68986030] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:36:48,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:36:48,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 22 [2024-10-11 13:36:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548477330] [2024-10-11 13:36:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:48,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:36:48,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:48,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:36:48,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:36:48,836 INFO L87 Difference]: Start difference. First operand 322 states and 445 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:50,595 INFO L93 Difference]: Finished difference Result 654 states and 907 transitions. [2024-10-11 13:36:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:36:50,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-11 13:36:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:50,600 INFO L225 Difference]: With dead ends: 654 [2024-10-11 13:36:50,600 INFO L226 Difference]: Without dead ends: 404 [2024-10-11 13:36:50,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:36:50,602 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 113 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:50,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 633 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:36:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-11 13:36:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 366. [2024-10-11 13:36:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 331 states have (on average 1.3776435045317221) internal successors, (456), 332 states have internal predecessors, (456), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:36:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 504 transitions. [2024-10-11 13:36:50,622 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 504 transitions. Word has length 85 [2024-10-11 13:36:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:50,622 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 504 transitions. [2024-10-11 13:36:50,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 504 transitions. [2024-10-11 13:36:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:36:50,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:50,624 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:50,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:50,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-11 13:36:50,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:50,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1870302028, now seen corresponding path program 1 times [2024-10-11 13:36:50,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:50,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564306557] [2024-10-11 13:36:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:50,826 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-11 13:36:50,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:50,827 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-11 13:36:50,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:51,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 13:36:51,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:36:56,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:36:56,425 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 1 case distinctions, treesize of input 159 treesize of output 87 [2024-10-11 13:36:56,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:36:56,437 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 1 case distinctions, treesize of input 135 treesize of output 63 [2024-10-11 13:36:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:36:56,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:36:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:36:57,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:36:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564306557] [2024-10-11 13:36:57,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564306557] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:36:57,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:36:57,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-10-11 13:36:57,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116808847] [2024-10-11 13:36:57,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:36:57,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:36:57,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:36:57,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:36:57,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:36:57,722 INFO L87 Difference]: Start difference. First operand 366 states and 504 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:36:58,391 INFO L93 Difference]: Finished difference Result 723 states and 998 transitions. [2024-10-11 13:36:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:36:58,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-11 13:36:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:36:58,396 INFO L225 Difference]: With dead ends: 723 [2024-10-11 13:36:58,396 INFO L226 Difference]: Without dead ends: 436 [2024-10-11 13:36:58,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:36:58,399 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 72 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:36:58,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 352 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:36:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-11 13:36:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 381. [2024-10-11 13:36:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 346 states have (on average 1.3670520231213872) internal successors, (473), 347 states have internal predecessors, (473), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:36:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 521 transitions. [2024-10-11 13:36:58,424 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 521 transitions. Word has length 85 [2024-10-11 13:36:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:36:58,424 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 521 transitions. [2024-10-11 13:36:58,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:36:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 521 transitions. [2024-10-11 13:36:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:36:58,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:36:58,426 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:36:58,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:58,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-11 13:36:58,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:36:58,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:36:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash 372595208, now seen corresponding path program 1 times [2024-10-11 13:36:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:36:58,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523668307] [2024-10-11 13:36:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:36:58,628 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-11 13:36:58,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:36:58,629 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-11 13:36:58,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:36:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:36:59,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:36:59,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:02,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:37:02,612 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 1 case distinctions, treesize of input 160 treesize of output 88 [2024-10-11 13:37:02,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:37:02,624 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 1 case distinctions, treesize of input 136 treesize of output 64 [2024-10-11 13:37:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:37:02,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:37:03,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523668307] [2024-10-11 13:37:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523668307] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:37:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-11 13:37:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992056453] [2024-10-11 13:37:03,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:03,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:03,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:37:03,656 INFO L87 Difference]: Start difference. First operand 381 states and 521 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:37:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:04,485 INFO L93 Difference]: Finished difference Result 735 states and 1009 transitions. [2024-10-11 13:37:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:37:04,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-11 13:37:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:04,489 INFO L225 Difference]: With dead ends: 735 [2024-10-11 13:37:04,494 INFO L226 Difference]: Without dead ends: 436 [2024-10-11 13:37:04,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:37:04,495 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 72 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:04,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 416 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:37:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-11 13:37:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 381. [2024-10-11 13:37:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 346 states have (on average 1.3583815028901733) internal successors, (470), 347 states have internal predecessors, (470), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:37:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 518 transitions. [2024-10-11 13:37:04,514 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 518 transitions. Word has length 85 [2024-10-11 13:37:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:04,515 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 518 transitions. [2024-10-11 13:37:04,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:37:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 518 transitions. [2024-10-11 13:37:04,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 13:37:04,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:04,516 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:37:04,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 13:37:04,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-11 13:37:04,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:04,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1052653578, now seen corresponding path program 1 times [2024-10-11 13:37:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82783097] [2024-10-11 13:37:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:04,718 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-11 13:37:04,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:04,719 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-11 13:37:04,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 13:37:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:05,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 13:37:05,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:10,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:37:10,245 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 1 case distinctions, treesize of input 159 treesize of output 87 [2024-10-11 13:37:10,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:37:10,475 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 1 case distinctions, treesize of input 135 treesize of output 63 [2024-10-11 13:37:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:37:10,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:37:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:37:12,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82783097] [2024-10-11 13:37:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82783097] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:37:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:37:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2024-10-11 13:37:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622273552] [2024-10-11 13:37:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:12,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:37:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:12,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:37:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:37:12,602 INFO L87 Difference]: Start difference. First operand 381 states and 518 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:37:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:14,480 INFO L93 Difference]: Finished difference Result 740 states and 1006 transitions. [2024-10-11 13:37:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:37:14,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-11 13:37:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:14,485 INFO L225 Difference]: With dead ends: 740 [2024-10-11 13:37:14,485 INFO L226 Difference]: Without dead ends: 441 [2024-10-11 13:37:14,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:37:14,487 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 49 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:14,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 767 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 13:37:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-11 13:37:14,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 437. [2024-10-11 13:37:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 397 states have (on average 1.3526448362720402) internal successors, (537), 400 states have internal predecessors, (537), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:37:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 589 transitions. [2024-10-11 13:37:14,518 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 589 transitions. Word has length 85 [2024-10-11 13:37:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:14,519 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 589 transitions. [2024-10-11 13:37:14,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:37:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 589 transitions. [2024-10-11 13:37:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 13:37:14,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:14,521 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:37:14,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 13:37:14,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-11 13:37:14,721 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:14,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash -581855366, now seen corresponding path program 1 times [2024-10-11 13:37:14,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:14,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436536002] [2024-10-11 13:37:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:14,722 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-11 13:37:14,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:14,724 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-11 13:37:14,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 13:37:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:15,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:37:15,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:15,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:37:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:37:15,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:15,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436536002] [2024-10-11 13:37:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436536002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:15,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:15,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:37:15,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281479381] [2024-10-11 13:37:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:15,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:37:15,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:15,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:37:15,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:37:15,411 INFO L87 Difference]: Start difference. First operand 437 states and 589 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:37:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:15,663 INFO L93 Difference]: Finished difference Result 840 states and 1137 transitions. [2024-10-11 13:37:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:37:15,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 86 [2024-10-11 13:37:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:15,667 INFO L225 Difference]: With dead ends: 840 [2024-10-11 13:37:15,667 INFO L226 Difference]: Without dead ends: 489 [2024-10-11 13:37:15,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:37:15,669 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 174 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:15,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 563 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:37:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-11 13:37:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 467. [2024-10-11 13:37:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 427 states have (on average 1.3395784543325526) internal successors, (572), 430 states have internal predecessors, (572), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:37:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 624 transitions. [2024-10-11 13:37:15,699 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 624 transitions. Word has length 86 [2024-10-11 13:37:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:15,699 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 624 transitions. [2024-10-11 13:37:15,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:37:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 624 transitions. [2024-10-11 13:37:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 13:37:15,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:15,701 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:37:15,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 13:37:15,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-11 13:37:15,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:15,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash -711143622, now seen corresponding path program 1 times [2024-10-11 13:37:15,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:15,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866380013] [2024-10-11 13:37:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:15,903 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-11 13:37:15,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:15,906 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-11 13:37:15,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 13:37:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:16,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:37:16,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:37:16,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:16,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866380013] [2024-10-11 13:37:16,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866380013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:16,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:16,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:37:16,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572216743] [2024-10-11 13:37:16,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:16,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:37:16,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:16,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:37:16,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:37:16,417 INFO L87 Difference]: Start difference. First operand 467 states and 624 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:37:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:37:16,615 INFO L93 Difference]: Finished difference Result 864 states and 1160 transitions. [2024-10-11 13:37:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:37:16,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 86 [2024-10-11 13:37:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:37:16,620 INFO L225 Difference]: With dead ends: 864 [2024-10-11 13:37:16,620 INFO L226 Difference]: Without dead ends: 483 [2024-10-11 13:37:16,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:37:16,622 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:37:16,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:37:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-11 13:37:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 480. [2024-10-11 13:37:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 440 states have (on average 1.3295454545454546) internal successors, (585), 443 states have internal predecessors, (585), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:37:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 637 transitions. [2024-10-11 13:37:16,646 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 637 transitions. Word has length 86 [2024-10-11 13:37:16,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:37:16,646 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 637 transitions. [2024-10-11 13:37:16,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 13:37:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 637 transitions. [2024-10-11 13:37:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 13:37:16,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:37:16,647 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:37:16,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 13:37:16,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-11 13:37:16,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:37:16,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:37:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2071816073, now seen corresponding path program 1 times [2024-10-11 13:37:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:37:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459621129] [2024-10-11 13:37:16,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:37:16,849 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-11 13:37:16,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:37:16,851 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-11 13:37:16,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 13:37:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:37:17,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 13:37:17,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:37:17,656 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 17 treesize of output 13 [2024-10-11 13:37:17,839 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 54 treesize of output 42 [2024-10-11 13:37:17,847 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 53 treesize of output 33 [2024-10-11 13:37:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 13:37:17,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:37:17,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:37:17,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459621129] [2024-10-11 13:37:17,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459621129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:37:17,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:37:17,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:37:17,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759701923] [2024-10-11 13:37:17,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:37:17,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:37:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:37:17,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:37:17,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:37:17,909 INFO L87 Difference]: Start difference. First operand 480 states and 637 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)