./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb9f80ac793eeca68c7fd49f4ea0c37ec5912db021eb8e0a4597e07f05d1e26c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:35:50,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:35:50,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:35:50,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:35:50,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:35:50,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:35:50,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:35:50,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:35:50,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:35:50,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:35:50,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:35:50,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:35:50,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:35:50,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:35:50,762 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:35:50,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:35:50,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:35:50,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:35:50,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:35:50,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:35:50,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:35:50,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:35:50,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:35:50,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:35:50,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:35:50,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:35:50,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:35:50,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:35:50,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:35:50,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:35:50,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:35:50,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:35:50,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:35:50,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:35:50,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:35:50,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:35:50,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:35:50,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:35:50,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:35:50,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:35:50,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:35:50,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:35:50,769 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb9f80ac793eeca68c7fd49f4ea0c37ec5912db021eb8e0a4597e07f05d1e26c [2024-11-22 12:35:50,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:35:50,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:35:50,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:35:50,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:35:50,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:35:50,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i [2024-11-22 12:35:52,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:35:52,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:35:52,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i [2024-11-22 12:35:52,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8cf826ae/fbe296af2f2643f3a2a535fb0cd02ca0/FLAG684a3dc7a [2024-11-22 12:35:52,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8cf826ae/fbe296af2f2643f3a2a535fb0cd02ca0 [2024-11-22 12:35:52,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:35:52,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:35:52,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:35:52,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:35:52,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:35:52,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:35:52" (1/1) ... [2024-11-22 12:35:52,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49992cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:52, skipping insertion in model container [2024-11-22 12:35:52,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:35:52" (1/1) ... [2024-11-22 12:35:52,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:35:52,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i[915,928] [2024-11-22 12:35:53,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:35:53,013 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:35:53,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i[915,928] [2024-11-22 12:35:53,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:35:53,078 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:35:53,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53 WrapperNode [2024-11-22 12:35:53,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:35:53,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:35:53,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:35:53,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:35:53,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,129 INFO L138 Inliner]: procedures = 29, calls = 170, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2024-11-22 12:35:53,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:35:53,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:35:53,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:35:53,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:35:53,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,169 INFO L175 MemorySlicer]: Split 135 memory accesses to 6 slices as follows [2, 16, 32, 28, 21, 36]. 27 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 4, 3, 3, 3]. The 18 writes are split as follows [0, 3, 4, 3, 4, 4]. [2024-11-22 12:35:53,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:35:53,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:35:53,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:35:53,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:35:53,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (1/1) ... [2024-11-22 12:35:53,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:35:53,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:35:53,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:35:53,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:35:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:35:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:35:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:35:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:35:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:35:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:35:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 12:35:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:35:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:35:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:35:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:35:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:35:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-22 12:35:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:35:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:35:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:35:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:35:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:35:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-22 12:35:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:35:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:35:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:35:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:35:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:35:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 12:35:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:35:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:35:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:35:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:35:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:35:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-22 12:35:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:35:53,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:35:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:35:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:35:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:35:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:35:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:35:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 12:35:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:35:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:35:53,425 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:35:53,427 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:35:53,860 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-11-22 12:35:53,863 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:35:53,876 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:35:53,878 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:35:53,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:35:53 BoogieIcfgContainer [2024-11-22 12:35:53,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:35:53,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:35:53,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:35:53,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:35:53,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:35:52" (1/3) ... [2024-11-22 12:35:53,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6909eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:35:53, skipping insertion in model container [2024-11-22 12:35:53,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:53" (2/3) ... [2024-11-22 12:35:53,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6909eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:35:53, skipping insertion in model container [2024-11-22 12:35:53,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:35:53" (3/3) ... [2024-11-22 12:35:53,886 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-6.i [2024-11-22 12:35:53,921 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:35:53,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:35:53,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:35:53,988 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;@4358bfac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:35:53,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:35:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:35:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 12:35:54,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:54,005 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:35:54,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:54,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash -607756942, now seen corresponding path program 1 times [2024-11-22 12:35:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:35:54,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794089041] [2024-11-22 12:35:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:54,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:35:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-22 12:35:54,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:35:54,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794089041] [2024-11-22 12:35:54,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794089041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:35:54,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513771093] [2024-11-22 12:35:54,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:54,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:35:54,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:35:54,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:35:54,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:35:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:54,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:35:54,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-22 12:35:54,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:35:54,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513771093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:54,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:35:54,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:35:54,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184377753] [2024-11-22 12:35:54,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:35:54,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:35:54,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:35:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:35:54,568 INFO L87 Difference]: Start difference. First operand has 122 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:35:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:54,590 INFO L93 Difference]: Finished difference Result 237 states and 371 transitions. [2024-11-22 12:35:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:35:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2024-11-22 12:35:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:54,597 INFO L225 Difference]: With dead ends: 237 [2024-11-22 12:35:54,597 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 12:35:54,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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-11-22 12:35:54,602 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:54,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:35:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 12:35:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-22 12:35:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 97 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:35:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-22 12:35:54,641 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 158 [2024-11-22 12:35:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:54,641 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-22 12:35:54,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:35:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-22 12:35:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 12:35:54,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:54,643 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:35:54,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:35:54,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:35:54,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1715716112, now seen corresponding path program 1 times [2024-11-22 12:35:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:35:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49431565] [2024-11-22 12:35:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:35:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:35:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:35:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49431565] [2024-11-22 12:35:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49431565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:55,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:35:55,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603841204] [2024-11-22 12:35:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:55,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:35:55,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:35:55,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:35:55,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:35:55,138 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:35:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:55,178 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2024-11-22 12:35:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:35:55,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2024-11-22 12:35:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:55,181 INFO L225 Difference]: With dead ends: 235 [2024-11-22 12:35:55,181 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 12:35:55,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:35:55,183 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:55,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:35:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 12:35:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-22 12:35:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:35:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2024-11-22 12:35:55,204 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 158 [2024-11-22 12:35:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:55,205 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2024-11-22 12:35:55,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:35:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2024-11-22 12:35:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 12:35:55,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:55,209 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:35:55,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:35:55,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:55,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash -931888242, now seen corresponding path program 1 times [2024-11-22 12:35:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:35:55,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193833199] [2024-11-22 12:35:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:35:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:35:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:35:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193833199] [2024-11-22 12:35:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193833199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:55,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:55,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:35:55,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773767537] [2024-11-22 12:35:55,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:55,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:35:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:35:55,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:35:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:35:55,456 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:35:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:55,477 INFO L93 Difference]: Finished difference Result 237 states and 345 transitions. [2024-11-22 12:35:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:35:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-22 12:35:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:55,481 INFO L225 Difference]: With dead ends: 237 [2024-11-22 12:35:55,483 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 12:35:55,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:35:55,484 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:55,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:35:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 12:35:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-22 12:35:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:35:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 173 transitions. [2024-11-22 12:35:55,495 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 173 transitions. Word has length 158 [2024-11-22 12:35:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:55,496 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 173 transitions. [2024-11-22 12:35:55,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:35:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 173 transitions. [2024-11-22 12:35:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 12:35:55,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:55,498 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:35:55,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 12:35:55,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:55,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1674135312, now seen corresponding path program 1 times [2024-11-22 12:35:55,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:35:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697566323] [2024-11-22 12:35:55,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:35:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 12:35:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:35:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697566323] [2024-11-22 12:35:55,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697566323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:35:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164623513] [2024-11-22 12:35:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:35:55,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:35:55,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:35:55,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 12:35:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:55,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:35:55,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:35:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:35:55,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:35:55,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164623513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:55,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:35:55,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-22 12:35:55,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756805918] [2024-11-22 12:35:55,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:55,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:35:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:35:55,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:35:55,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:35:55,957 INFO L87 Difference]: Start difference. First operand 120 states and 173 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:35:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:55,990 INFO L93 Difference]: Finished difference Result 239 states and 346 transitions. [2024-11-22 12:35:55,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:35:55,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-22 12:35:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:55,994 INFO L225 Difference]: With dead ends: 239 [2024-11-22 12:35:55,994 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 12:35:55,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:35:55,995 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:55,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:35:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 12:35:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-22 12:35:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:35:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2024-11-22 12:35:56,008 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 158 [2024-11-22 12:35:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:56,008 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2024-11-22 12:35:56,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:35:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2024-11-22 12:35:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 12:35:56,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:56,010 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:35:56,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 12:35:56,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-22 12:35:56,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:56,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1776006338, now seen corresponding path program 1 times [2024-11-22 12:35:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:35:56,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679546939] [2024-11-22 12:35:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:56,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:35:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:35:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:35:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679546939] [2024-11-22 12:35:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679546939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:56,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:56,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:35:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598013593] [2024-11-22 12:35:56,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:35:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:35:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:35:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:35:56,468 INFO L87 Difference]: Start difference. First operand 122 states and 175 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:35:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:56,513 INFO L93 Difference]: Finished difference Result 241 states and 347 transitions. [2024-11-22 12:35:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:35:56,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-22 12:35:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:56,516 INFO L225 Difference]: With dead ends: 241 [2024-11-22 12:35:56,516 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 12:35:56,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:35:56,518 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:56,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 481 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:35:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 12:35:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-22 12:35:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:35:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2024-11-22 12:35:56,524 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 160 [2024-11-22 12:35:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:56,525 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2024-11-22 12:35:56,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:35:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2024-11-22 12:35:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 12:35:56,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:56,526 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:35:56,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:35:56,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:56,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:56,527 INFO L85 PathProgramCache]: Analyzing trace with hash 187658436, now seen corresponding path program 1 times [2024-11-22 12:35:56,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:35:56,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647236255] [2024-11-22 12:35:56,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:56,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:35:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:35:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:35:57,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:35:57,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647236255] [2024-11-22 12:35:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647236255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:35:57,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:35:57,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 12:35:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260464491] [2024-11-22 12:35:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:35:57,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:35:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:35:57,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:35:57,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:35:57,915 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-22 12:35:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:35:58,222 INFO L93 Difference]: Finished difference Result 348 states and 497 transitions. [2024-11-22 12:35:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:35:58,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 160 [2024-11-22 12:35:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:35:58,224 INFO L225 Difference]: With dead ends: 348 [2024-11-22 12:35:58,224 INFO L226 Difference]: Without dead ends: 229 [2024-11-22 12:35:58,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:35:58,225 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 130 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:35:58,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1610 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:35:58,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-22 12:35:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-11-22 12:35:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 190 states have (on average 1.3473684210526315) internal successors, (256), 191 states have internal predecessors, (256), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 12:35:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 322 transitions. [2024-11-22 12:35:58,238 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 322 transitions. Word has length 160 [2024-11-22 12:35:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:35:58,239 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 322 transitions. [2024-11-22 12:35:58,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-22 12:35:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 322 transitions. [2024-11-22 12:35:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 12:35:58,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:35:58,240 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:35:58,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 12:35:58,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:35:58,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:35:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash -938376661, now seen corresponding path program 1 times [2024-11-22 12:35:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:35:58,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494977004] [2024-11-22 12:35:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:35:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:35:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 12:36:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494977004] [2024-11-22 12:36:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494977004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:01,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:01,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-22 12:36:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049538358] [2024-11-22 12:36:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:01,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 12:36:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 12:36:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-22 12:36:01,791 INFO L87 Difference]: Start difference. First operand 226 states and 322 transitions. Second operand has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:13,637 INFO L93 Difference]: Finished difference Result 920 states and 1309 transitions. [2024-11-22 12:36:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-22 12:36:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2024-11-22 12:36:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:13,642 INFO L225 Difference]: With dead ends: 920 [2024-11-22 12:36:13,642 INFO L226 Difference]: Without dead ends: 697 [2024-11-22 12:36:13,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2024-11-22 12:36:13,644 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 745 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:13,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1650 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-22 12:36:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-22 12:36:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 516. [2024-11-22 12:36:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 427 states have (on average 1.334894613583138) internal successors, (570), 430 states have internal predecessors, (570), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 79 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-22 12:36:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 734 transitions. [2024-11-22 12:36:13,703 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 734 transitions. Word has length 160 [2024-11-22 12:36:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:13,703 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 734 transitions. [2024-11-22 12:36:13,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 734 transitions. [2024-11-22 12:36:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-22 12:36:13,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:13,705 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:13,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 12:36:13,706 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:13,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash -789930225, now seen corresponding path program 1 times [2024-11-22 12:36:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:13,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679982543] [2024-11-22 12:36:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:14,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:14,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679982543] [2024-11-22 12:36:14,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679982543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:14,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:14,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 12:36:14,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253374598] [2024-11-22 12:36:14,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:14,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 12:36:14,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:14,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 12:36:14,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:36:14,663 INFO L87 Difference]: Start difference. First operand 516 states and 734 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-22 12:36:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:15,323 INFO L93 Difference]: Finished difference Result 872 states and 1239 transitions. [2024-11-22 12:36:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 12:36:15,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 161 [2024-11-22 12:36:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:15,326 INFO L225 Difference]: With dead ends: 872 [2024-11-22 12:36:15,326 INFO L226 Difference]: Without dead ends: 569 [2024-11-22 12:36:15,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-22 12:36:15,327 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 331 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:15,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1147 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:36:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-22 12:36:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 539. [2024-11-22 12:36:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 450 states have (on average 1.3355555555555556) internal successors, (601), 453 states have internal predecessors, (601), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 79 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-22 12:36:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 765 transitions. [2024-11-22 12:36:15,373 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 765 transitions. Word has length 161 [2024-11-22 12:36:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:15,373 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 765 transitions. [2024-11-22 12:36:15,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-22 12:36:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 765 transitions. [2024-11-22 12:36:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-22 12:36:15,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:15,375 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:15,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 12:36:15,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:15,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash -949690418, now seen corresponding path program 1 times [2024-11-22 12:36:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142956650] [2024-11-22 12:36:15,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:15,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:15,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142956650] [2024-11-22 12:36:15,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142956650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:15,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 12:36:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360402928] [2024-11-22 12:36:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:15,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:36:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:36:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:36:15,842 INFO L87 Difference]: Start difference. First operand 539 states and 765 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:16,183 INFO L93 Difference]: Finished difference Result 1458 states and 2069 transitions. [2024-11-22 12:36:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:36:16,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-22 12:36:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:16,189 INFO L225 Difference]: With dead ends: 1458 [2024-11-22 12:36:16,189 INFO L226 Difference]: Without dead ends: 1050 [2024-11-22 12:36:16,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:36:16,191 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 266 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:16,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 750 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:36:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-22 12:36:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 961. [2024-11-22 12:36:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 805 states have (on average 1.3316770186335403) internal successors, (1072), 811 states have internal predecessors, (1072), 145 states have call successors, (145), 10 states have call predecessors, (145), 10 states have return successors, (145), 139 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-22 12:36:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1362 transitions. [2024-11-22 12:36:16,272 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1362 transitions. Word has length 161 [2024-11-22 12:36:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:16,272 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1362 transitions. [2024-11-22 12:36:16,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1362 transitions. [2024-11-22 12:36:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-22 12:36:16,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:16,273 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:16,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 12:36:16,273 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:16,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:16,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1656333136, now seen corresponding path program 1 times [2024-11-22 12:36:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:16,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267631795] [2024-11-22 12:36:16,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:16,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:16,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267631795] [2024-11-22 12:36:16,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267631795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:16,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:16,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:36:16,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769034440] [2024-11-22 12:36:16,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:16,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:36:16,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:16,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:36:16,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:36:16,555 INFO L87 Difference]: Start difference. First operand 961 states and 1362 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:16,760 INFO L93 Difference]: Finished difference Result 2545 states and 3630 transitions. [2024-11-22 12:36:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:36:16,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-22 12:36:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:16,770 INFO L225 Difference]: With dead ends: 2545 [2024-11-22 12:36:16,771 INFO L226 Difference]: Without dead ends: 1795 [2024-11-22 12:36:16,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:36:16,773 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 162 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:16,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1298 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:36:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-11-22 12:36:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1771. [2024-11-22 12:36:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1481 states have (on average 1.3328831870357867) internal successors, (1974), 1493 states have internal predecessors, (1974), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 259 states have call predecessors, (271), 271 states have call successors, (271) [2024-11-22 12:36:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2516 transitions. [2024-11-22 12:36:16,906 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2516 transitions. Word has length 161 [2024-11-22 12:36:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:16,906 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2516 transitions. [2024-11-22 12:36:16,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2516 transitions. [2024-11-22 12:36:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-22 12:36:16,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:16,910 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:16,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 12:36:16,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:16,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1627516910, now seen corresponding path program 1 times [2024-11-22 12:36:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808814830] [2024-11-22 12:36:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:17,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808814830] [2024-11-22 12:36:17,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808814830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:17,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:17,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 12:36:17,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241019957] [2024-11-22 12:36:17,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:17,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:36:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:36:17,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:36:17,405 INFO L87 Difference]: Start difference. First operand 1771 states and 2516 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:17,827 INFO L93 Difference]: Finished difference Result 2986 states and 4243 transitions. [2024-11-22 12:36:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:36:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-22 12:36:17,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:17,834 INFO L225 Difference]: With dead ends: 2986 [2024-11-22 12:36:17,835 INFO L226 Difference]: Without dead ends: 1933 [2024-11-22 12:36:17,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:36:17,837 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 235 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:17,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 901 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:36:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2024-11-22 12:36:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1759. [2024-11-22 12:36:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1469 states have (on average 1.328795098706603) internal successors, (1952), 1481 states have internal predecessors, (1952), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 259 states have call predecessors, (271), 271 states have call successors, (271) [2024-11-22 12:36:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2494 transitions. [2024-11-22 12:36:17,978 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2494 transitions. Word has length 161 [2024-11-22 12:36:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:17,979 INFO L471 AbstractCegarLoop]: Abstraction has 1759 states and 2494 transitions. [2024-11-22 12:36:17,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2494 transitions. [2024-11-22 12:36:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-22 12:36:17,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:17,982 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:17,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 12:36:17,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:17,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1083703924, now seen corresponding path program 1 times [2024-11-22 12:36:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:17,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086244930] [2024-11-22 12:36:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:17,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:18,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:18,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086244930] [2024-11-22 12:36:18,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086244930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:18,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:18,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 12:36:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248434957] [2024-11-22 12:36:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:18,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 12:36:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 12:36:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:36:18,722 INFO L87 Difference]: Start difference. First operand 1759 states and 2494 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:19,320 INFO L93 Difference]: Finished difference Result 2374 states and 3372 transitions. [2024-11-22 12:36:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 12:36:19,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2024-11-22 12:36:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:19,327 INFO L225 Difference]: With dead ends: 2374 [2024-11-22 12:36:19,327 INFO L226 Difference]: Without dead ends: 1745 [2024-11-22 12:36:19,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-22 12:36:19,329 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 162 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:19,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1051 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:36:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2024-11-22 12:36:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1743. [2024-11-22 12:36:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1453 states have (on average 1.3269098417068135) internal successors, (1928), 1465 states have internal predecessors, (1928), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 259 states have call predecessors, (271), 271 states have call successors, (271) [2024-11-22 12:36:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2470 transitions. [2024-11-22 12:36:19,477 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2470 transitions. Word has length 161 [2024-11-22 12:36:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:19,477 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2470 transitions. [2024-11-22 12:36:19,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2470 transitions. [2024-11-22 12:36:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-22 12:36:19,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:19,479 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:19,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 12:36:19,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:19,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1761530416, now seen corresponding path program 1 times [2024-11-22 12:36:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:19,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380053788] [2024-11-22 12:36:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:19,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380053788] [2024-11-22 12:36:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380053788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:20,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 12:36:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666169007] [2024-11-22 12:36:20,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:20,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:36:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:20,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:36:20,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:36:20,381 INFO L87 Difference]: Start difference. First operand 1743 states and 2470 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:21,095 INFO L93 Difference]: Finished difference Result 2478 states and 3514 transitions. [2024-11-22 12:36:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 12:36:21,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2024-11-22 12:36:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:21,103 INFO L225 Difference]: With dead ends: 2478 [2024-11-22 12:36:21,103 INFO L226 Difference]: Without dead ends: 1863 [2024-11-22 12:36:21,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-11-22 12:36:21,106 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 312 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:21,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1103 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:36:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-11-22 12:36:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1777. [2024-11-22 12:36:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1471 states have (on average 1.3201903467029232) internal successors, (1942), 1483 states have internal predecessors, (1942), 283 states have call successors, (283), 22 states have call predecessors, (283), 22 states have return successors, (283), 271 states have call predecessors, (283), 283 states have call successors, (283) [2024-11-22 12:36:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2508 transitions. [2024-11-22 12:36:21,239 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2508 transitions. Word has length 161 [2024-11-22 12:36:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:21,239 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2508 transitions. [2024-11-22 12:36:21,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2508 transitions. [2024-11-22 12:36:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 12:36:21,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:21,241 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:21,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 12:36:21,241 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:21,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:21,242 INFO L85 PathProgramCache]: Analyzing trace with hash 549334998, now seen corresponding path program 1 times [2024-11-22 12:36:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:21,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806535998] [2024-11-22 12:36:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 12:36:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806535998] [2024-11-22 12:36:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806535998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:36:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130812143] [2024-11-22 12:36:21,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:21,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:36:21,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:36:21,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:36:21,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 12:36:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:21,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:36:21,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:36:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:21,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:36:21,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130812143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:21,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:36:21,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-22 12:36:21,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183668305] [2024-11-22 12:36:21,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:21,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:36:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:21,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:36:21,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:36:21,577 INFO L87 Difference]: Start difference. First operand 1777 states and 2508 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:21,715 INFO L93 Difference]: Finished difference Result 3261 states and 4621 transitions. [2024-11-22 12:36:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:36:21,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 162 [2024-11-22 12:36:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:21,724 INFO L225 Difference]: With dead ends: 3261 [2024-11-22 12:36:21,724 INFO L226 Difference]: Without dead ends: 1825 [2024-11-22 12:36:21,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:36:21,727 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:21,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 651 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:36:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-22 12:36:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1825. [2024-11-22 12:36:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1519 states have (on average 1.3100724160631996) internal successors, (1990), 1531 states have internal predecessors, (1990), 283 states have call successors, (283), 22 states have call predecessors, (283), 22 states have return successors, (283), 271 states have call predecessors, (283), 283 states have call successors, (283) [2024-11-22 12:36:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2556 transitions. [2024-11-22 12:36:21,919 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2556 transitions. Word has length 162 [2024-11-22 12:36:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:21,920 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2556 transitions. [2024-11-22 12:36:21,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2556 transitions. [2024-11-22 12:36:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 12:36:21,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:21,922 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:21,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 12:36:22,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:36:22,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:22,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1145508905, now seen corresponding path program 1 times [2024-11-22 12:36:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:22,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380013957] [2024-11-22 12:36:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:23,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380013957] [2024-11-22 12:36:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380013957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:23,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:23,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 12:36:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255959010] [2024-11-22 12:36:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:23,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 12:36:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 12:36:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:36:23,006 INFO L87 Difference]: Start difference. First operand 1825 states and 2556 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-22 12:36:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:23,808 INFO L93 Difference]: Finished difference Result 3161 states and 4426 transitions. [2024-11-22 12:36:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 12:36:23,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 162 [2024-11-22 12:36:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:23,816 INFO L225 Difference]: With dead ends: 3161 [2024-11-22 12:36:23,816 INFO L226 Difference]: Without dead ends: 1865 [2024-11-22 12:36:23,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-22 12:36:23,820 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 389 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:23,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1088 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:36:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-22 12:36:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1805. [2024-11-22 12:36:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1499 states have (on average 1.306204136090727) internal successors, (1958), 1511 states have internal predecessors, (1958), 283 states have call successors, (283), 22 states have call predecessors, (283), 22 states have return successors, (283), 271 states have call predecessors, (283), 283 states have call successors, (283) [2024-11-22 12:36:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2524 transitions. [2024-11-22 12:36:23,939 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2524 transitions. Word has length 162 [2024-11-22 12:36:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:23,939 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2524 transitions. [2024-11-22 12:36:23,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 10 states have internal predecessors, (70), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-22 12:36:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2524 transitions. [2024-11-22 12:36:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-22 12:36:23,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:23,941 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:23,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 12:36:23,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:23,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2014323788, now seen corresponding path program 1 times [2024-11-22 12:36:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517061809] [2024-11-22 12:36:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:24,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:24,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517061809] [2024-11-22 12:36:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517061809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 12:36:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254801713] [2024-11-22 12:36:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:24,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:36:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:24,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:36:24,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:36:24,557 INFO L87 Difference]: Start difference. First operand 1805 states and 2524 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:25,018 INFO L93 Difference]: Finished difference Result 3836 states and 5371 transitions. [2024-11-22 12:36:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 12:36:25,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2024-11-22 12:36:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:25,028 INFO L225 Difference]: With dead ends: 3836 [2024-11-22 12:36:25,028 INFO L226 Difference]: Without dead ends: 2604 [2024-11-22 12:36:25,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:36:25,032 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 114 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:25,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1700 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:36:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2024-11-22 12:36:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2582. [2024-11-22 12:36:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2204 states have (on average 1.311705989110708) internal successors, (2891), 2224 states have internal predecessors, (2891), 347 states have call successors, (347), 30 states have call predecessors, (347), 30 states have return successors, (347), 327 states have call predecessors, (347), 347 states have call successors, (347) [2024-11-22 12:36:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3585 transitions. [2024-11-22 12:36:25,180 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3585 transitions. Word has length 163 [2024-11-22 12:36:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:25,180 INFO L471 AbstractCegarLoop]: Abstraction has 2582 states and 3585 transitions. [2024-11-22 12:36:25,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3585 transitions. [2024-11-22 12:36:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-22 12:36:25,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:25,182 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 12:36:25,182 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash -258876517, now seen corresponding path program 1 times [2024-11-22 12:36:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236028709] [2024-11-22 12:36:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:25,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:25,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236028709] [2024-11-22 12:36:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236028709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:25,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 12:36:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52695701] [2024-11-22 12:36:25,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:25,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 12:36:25,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:25,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 12:36:25,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:36:25,906 INFO L87 Difference]: Start difference. First operand 2582 states and 3585 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:26,702 INFO L93 Difference]: Finished difference Result 4540 states and 6324 transitions. [2024-11-22 12:36:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 12:36:26,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 163 [2024-11-22 12:36:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:26,716 INFO L225 Difference]: With dead ends: 4540 [2024-11-22 12:36:26,716 INFO L226 Difference]: Without dead ends: 3870 [2024-11-22 12:36:26,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:36:26,719 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 290 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:26,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 2332 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 12:36:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2024-11-22 12:36:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3852. [2024-11-22 12:36:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3852 states, 3304 states have (on average 1.3141646489104115) internal successors, (4342), 3334 states have internal predecessors, (4342), 505 states have call successors, (505), 42 states have call predecessors, (505), 42 states have return successors, (505), 475 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-22 12:36:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 5352 transitions. [2024-11-22 12:36:26,943 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 5352 transitions. Word has length 163 [2024-11-22 12:36:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:26,943 INFO L471 AbstractCegarLoop]: Abstraction has 3852 states and 5352 transitions. [2024-11-22 12:36:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 5352 transitions. [2024-11-22 12:36:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-22 12:36:26,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:26,945 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:26,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 12:36:26,946 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:26,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1664351517, now seen corresponding path program 1 times [2024-11-22 12:36:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:26,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092958742] [2024-11-22 12:36:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092958742] [2024-11-22 12:36:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092958742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:27,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:27,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:36:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396177081] [2024-11-22 12:36:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:27,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:36:27,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:27,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:36:27,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:36:27,121 INFO L87 Difference]: Start difference. First operand 3852 states and 5352 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:27,295 INFO L93 Difference]: Finished difference Result 5696 states and 7941 transitions. [2024-11-22 12:36:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:36:27,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 163 [2024-11-22 12:36:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:27,309 INFO L225 Difference]: With dead ends: 5696 [2024-11-22 12:36:27,309 INFO L226 Difference]: Without dead ends: 3780 [2024-11-22 12:36:27,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:36:27,314 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:27,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:36:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2024-11-22 12:36:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 3190. [2024-11-22 12:36:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 2727 states have (on average 1.312064539787312) internal successors, (3578), 2752 states have internal predecessors, (3578), 426 states have call successors, (426), 36 states have call predecessors, (426), 36 states have return successors, (426), 401 states have call predecessors, (426), 426 states have call successors, (426) [2024-11-22 12:36:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 4430 transitions. [2024-11-22 12:36:27,572 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 4430 transitions. Word has length 163 [2024-11-22 12:36:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:27,572 INFO L471 AbstractCegarLoop]: Abstraction has 3190 states and 4430 transitions. [2024-11-22 12:36:27,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 4430 transitions. [2024-11-22 12:36:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-22 12:36:27,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:27,575 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:27,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 12:36:27,576 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:27,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1991691534, now seen corresponding path program 1 times [2024-11-22 12:36:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:27,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34482137] [2024-11-22 12:36:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:27,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 12:36:27,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34482137] [2024-11-22 12:36:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34482137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:36:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462715776] [2024-11-22 12:36:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:36:27,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:36:27,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:36:27,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 12:36:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:28,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 12:36:28,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:36:28,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 12:36:28,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:36:28,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 32 [2024-11-22 12:36:28,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:36:28,616 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 37 treesize of output 19 [2024-11-22 12:36:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-22 12:36:28,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:36:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 87 proven. 18 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-22 12:36:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462715776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:36:29,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 12:36:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 25 [2024-11-22 12:36:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391766344] [2024-11-22 12:36:29,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 12:36:29,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 12:36:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 12:36:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2024-11-22 12:36:29,059 INFO L87 Difference]: Start difference. First operand 3190 states and 4430 transitions. Second operand has 25 states, 21 states have (on average 6.809523809523809) internal successors, (143), 24 states have internal predecessors, (143), 9 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 6 states have call predecessors, (57), 9 states have call successors, (57) [2024-11-22 12:36:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:29,733 INFO L93 Difference]: Finished difference Result 5491 states and 7618 transitions. [2024-11-22 12:36:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 12:36:29,734 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 6.809523809523809) internal successors, (143), 24 states have internal predecessors, (143), 9 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 6 states have call predecessors, (57), 9 states have call successors, (57) Word has length 163 [2024-11-22 12:36:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:29,752 INFO L225 Difference]: With dead ends: 5491 [2024-11-22 12:36:29,752 INFO L226 Difference]: Without dead ends: 3141 [2024-11-22 12:36:29,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2024-11-22 12:36:29,757 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 480 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:29,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1446 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:36:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-11-22 12:36:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 3105. [2024-11-22 12:36:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 2635 states have (on average 1.30853889943074) internal successors, (3448), 2657 states have internal predecessors, (3448), 427 states have call successors, (427), 42 states have call predecessors, (427), 42 states have return successors, (427), 405 states have call predecessors, (427), 427 states have call successors, (427) [2024-11-22 12:36:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 4302 transitions. [2024-11-22 12:36:29,912 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 4302 transitions. Word has length 163 [2024-11-22 12:36:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:29,912 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 4302 transitions. [2024-11-22 12:36:29,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 6.809523809523809) internal successors, (143), 24 states have internal predecessors, (143), 9 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 6 states have call predecessors, (57), 9 states have call successors, (57) [2024-11-22 12:36:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 4302 transitions. [2024-11-22 12:36:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 12:36:29,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:29,914 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:29,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 12:36:30,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:36:30,114 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:30,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1360022434, now seen corresponding path program 1 times [2024-11-22 12:36:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:30,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577135974] [2024-11-22 12:36:30,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577135974] [2024-11-22 12:36:30,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577135974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:30,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:30,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 12:36:30,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280634459] [2024-11-22 12:36:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:30,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 12:36:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 12:36:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:36:30,513 INFO L87 Difference]: Start difference. First operand 3105 states and 4302 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:31,257 INFO L93 Difference]: Finished difference Result 5213 states and 7194 transitions. [2024-11-22 12:36:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 12:36:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2024-11-22 12:36:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:31,275 INFO L225 Difference]: With dead ends: 5213 [2024-11-22 12:36:31,275 INFO L226 Difference]: Without dead ends: 4345 [2024-11-22 12:36:31,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-22 12:36:31,279 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 418 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:31,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1926 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:36:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2024-11-22 12:36:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 3977. [2024-11-22 12:36:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3385 states have (on average 1.3069423929098967) internal successors, (4424), 3413 states have internal predecessors, (4424), 539 states have call successors, (539), 52 states have call predecessors, (539), 52 states have return successors, (539), 511 states have call predecessors, (539), 539 states have call successors, (539) [2024-11-22 12:36:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 5502 transitions. [2024-11-22 12:36:31,503 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 5502 transitions. Word has length 164 [2024-11-22 12:36:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:31,504 INFO L471 AbstractCegarLoop]: Abstraction has 3977 states and 5502 transitions. [2024-11-22 12:36:31,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 5502 transitions. [2024-11-22 12:36:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 12:36:31,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:31,507 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:31,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 12:36:31,507 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:31,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2037848926, now seen corresponding path program 1 times [2024-11-22 12:36:31,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:31,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579231282] [2024-11-22 12:36:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:31,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:31,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579231282] [2024-11-22 12:36:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579231282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:31,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:31,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 12:36:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357650187] [2024-11-22 12:36:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:31,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:36:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:31,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:36:31,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:36:31,952 INFO L87 Difference]: Start difference. First operand 3977 states and 5502 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:32,886 INFO L93 Difference]: Finished difference Result 6005 states and 8290 transitions. [2024-11-22 12:36:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 12:36:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2024-11-22 12:36:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:32,898 INFO L225 Difference]: With dead ends: 6005 [2024-11-22 12:36:32,898 INFO L226 Difference]: Without dead ends: 4327 [2024-11-22 12:36:32,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-11-22 12:36:32,904 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 475 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:32,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1863 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 12:36:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2024-11-22 12:36:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 3959. [2024-11-22 12:36:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3367 states have (on average 1.305019305019305) internal successors, (4394), 3395 states have internal predecessors, (4394), 539 states have call successors, (539), 52 states have call predecessors, (539), 52 states have return successors, (539), 511 states have call predecessors, (539), 539 states have call successors, (539) [2024-11-22 12:36:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5472 transitions. [2024-11-22 12:36:33,142 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5472 transitions. Word has length 164 [2024-11-22 12:36:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:33,142 INFO L471 AbstractCegarLoop]: Abstraction has 3959 states and 5472 transitions. [2024-11-22 12:36:33,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5472 transitions. [2024-11-22 12:36:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 12:36:33,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:33,144 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:33,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 12:36:33,144 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:33,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1494035940, now seen corresponding path program 1 times [2024-11-22 12:36:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101545735] [2024-11-22 12:36:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:33,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101545735] [2024-11-22 12:36:33,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101545735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:33,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:33,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 12:36:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518285352] [2024-11-22 12:36:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:33,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:36:33,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:33,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:36:33,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:36:33,541 INFO L87 Difference]: Start difference. First operand 3959 states and 5472 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:33,927 INFO L93 Difference]: Finished difference Result 6209 states and 8617 transitions. [2024-11-22 12:36:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:36:33,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2024-11-22 12:36:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:33,936 INFO L225 Difference]: With dead ends: 6209 [2024-11-22 12:36:33,937 INFO L226 Difference]: Without dead ends: 4705 [2024-11-22 12:36:33,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:36:33,940 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 151 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:33,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1389 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:36:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2024-11-22 12:36:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 3974. [2024-11-22 12:36:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 3382 states have (on average 1.3027794204612655) internal successors, (4406), 3410 states have internal predecessors, (4406), 539 states have call successors, (539), 52 states have call predecessors, (539), 52 states have return successors, (539), 511 states have call predecessors, (539), 539 states have call successors, (539) [2024-11-22 12:36:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5484 transitions. [2024-11-22 12:36:34,173 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5484 transitions. Word has length 164 [2024-11-22 12:36:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:34,173 INFO L471 AbstractCegarLoop]: Abstraction has 3974 states and 5484 transitions. [2024-11-22 12:36:34,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5484 transitions. [2024-11-22 12:36:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 12:36:34,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:34,175 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:34,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 12:36:34,175 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:34,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash -482918690, now seen corresponding path program 1 times [2024-11-22 12:36:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035374726] [2024-11-22 12:36:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:34,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035374726] [2024-11-22 12:36:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035374726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:34,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:36:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726635505] [2024-11-22 12:36:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:34,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:36:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:36:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:36:34,407 INFO L87 Difference]: Start difference. First operand 3974 states and 5484 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:34,693 INFO L93 Difference]: Finished difference Result 6677 states and 9239 transitions. [2024-11-22 12:36:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:36:34,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2024-11-22 12:36:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:34,705 INFO L225 Difference]: With dead ends: 6677 [2024-11-22 12:36:34,705 INFO L226 Difference]: Without dead ends: 5166 [2024-11-22 12:36:34,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:36:34,710 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 161 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:34,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1383 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:36:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2024-11-22 12:36:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4299. [2024-11-22 12:36:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4299 states, 3663 states have (on average 1.3052143052143053) internal successors, (4781), 3693 states have internal predecessors, (4781), 580 states have call successors, (580), 55 states have call predecessors, (580), 55 states have return successors, (580), 550 states have call predecessors, (580), 580 states have call successors, (580) [2024-11-22 12:36:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 5941 transitions. [2024-11-22 12:36:34,958 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 5941 transitions. Word has length 164 [2024-11-22 12:36:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:34,958 INFO L471 AbstractCegarLoop]: Abstraction has 4299 states and 5941 transitions. [2024-11-22 12:36:34,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 5941 transitions. [2024-11-22 12:36:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 12:36:34,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:34,960 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:34,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 12:36:34,960 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:34,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2123104864, now seen corresponding path program 1 times [2024-11-22 12:36:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:34,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301451932] [2024-11-22 12:36:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:35,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:35,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301451932] [2024-11-22 12:36:35,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301451932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:35,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:35,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 12:36:35,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48565322] [2024-11-22 12:36:35,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:35,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 12:36:35,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:35,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 12:36:35,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:36:35,762 INFO L87 Difference]: Start difference. First operand 4299 states and 5941 transitions. Second operand has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:36,699 INFO L93 Difference]: Finished difference Result 5865 states and 8097 transitions. [2024-11-22 12:36:36,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 12:36:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 164 [2024-11-22 12:36:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:36,710 INFO L225 Difference]: With dead ends: 5865 [2024-11-22 12:36:36,710 INFO L226 Difference]: Without dead ends: 5011 [2024-11-22 12:36:36,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2024-11-22 12:36:36,713 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 399 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:36,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1780 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:36:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2024-11-22 12:36:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4487. [2024-11-22 12:36:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4487 states, 3809 states have (on average 1.3034917301128905) internal successors, (4965), 3841 states have internal predecessors, (4965), 618 states have call successors, (618), 59 states have call predecessors, (618), 59 states have return successors, (618), 586 states have call predecessors, (618), 618 states have call successors, (618) [2024-11-22 12:36:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 6201 transitions. [2024-11-22 12:36:36,962 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 6201 transitions. Word has length 164 [2024-11-22 12:36:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:36,962 INFO L471 AbstractCegarLoop]: Abstraction has 4487 states and 6201 transitions. [2024-11-22 12:36:36,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 6201 transitions. [2024-11-22 12:36:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 12:36:36,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:36,964 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:36,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 12:36:36,965 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:36,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2031266341, now seen corresponding path program 1 times [2024-11-22 12:36:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547712338] [2024-11-22 12:36:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:37,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547712338] [2024-11-22 12:36:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547712338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:37,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:37,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:36:37,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322366981] [2024-11-22 12:36:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:37,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:36:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:37,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:36:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:36:37,016 INFO L87 Difference]: Start difference. First operand 4487 states and 6201 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:37,253 INFO L93 Difference]: Finished difference Result 10228 states and 14089 transitions. [2024-11-22 12:36:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:36:37,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2024-11-22 12:36:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:37,266 INFO L225 Difference]: With dead ends: 10228 [2024-11-22 12:36:37,266 INFO L226 Difference]: Without dead ends: 6119 [2024-11-22 12:36:37,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:36:37,275 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 39 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:37,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 329 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:36:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6119 states. [2024-11-22 12:36:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6119 to 5522. [2024-11-22 12:36:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5522 states, 4844 states have (on average 1.287159372419488) internal successors, (6235), 4876 states have internal predecessors, (6235), 618 states have call successors, (618), 59 states have call predecessors, (618), 59 states have return successors, (618), 586 states have call predecessors, (618), 618 states have call successors, (618) [2024-11-22 12:36:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 7471 transitions. [2024-11-22 12:36:37,534 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 7471 transitions. Word has length 164 [2024-11-22 12:36:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:37,535 INFO L471 AbstractCegarLoop]: Abstraction has 5522 states and 7471 transitions. [2024-11-22 12:36:37,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 7471 transitions. [2024-11-22 12:36:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 12:36:37,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:37,537 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:37,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 12:36:37,537 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:37,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash -807307064, now seen corresponding path program 1 times [2024-11-22 12:36:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:37,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20659096] [2024-11-22 12:36:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 12:36:37,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:36:37,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20659096] [2024-11-22 12:36:37,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20659096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:36:37,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111549383] [2024-11-22 12:36:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:37,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:36:37,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:36:37,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:36:37,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 12:36:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:37,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:36:37,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:36:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:37,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:36:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111549383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:37,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:36:37,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-22 12:36:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883761907] [2024-11-22 12:36:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:37,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:36:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:36:37,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:36:37,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:36:37,889 INFO L87 Difference]: Start difference. First operand 5522 states and 7471 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:38,117 INFO L93 Difference]: Finished difference Result 10417 states and 14188 transitions. [2024-11-22 12:36:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:36:38,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 164 [2024-11-22 12:36:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:38,129 INFO L225 Difference]: With dead ends: 10417 [2024-11-22 12:36:38,130 INFO L226 Difference]: Without dead ends: 5645 [2024-11-22 12:36:38,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:36:38,136 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:38,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 648 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:36:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5645 states. [2024-11-22 12:36:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5645 to 5645. [2024-11-22 12:36:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5645 states, 4967 states have (on average 1.2800483189047716) internal successors, (6358), 4999 states have internal predecessors, (6358), 618 states have call successors, (618), 59 states have call predecessors, (618), 59 states have return successors, (618), 586 states have call predecessors, (618), 618 states have call successors, (618) [2024-11-22 12:36:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5645 states to 5645 states and 7594 transitions. [2024-11-22 12:36:38,377 INFO L78 Accepts]: Start accepts. Automaton has 5645 states and 7594 transitions. Word has length 164 [2024-11-22 12:36:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:38,378 INFO L471 AbstractCegarLoop]: Abstraction has 5645 states and 7594 transitions. [2024-11-22 12:36:38,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 5645 states and 7594 transitions. [2024-11-22 12:36:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-22 12:36:38,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:38,380 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:38,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 12:36:38,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-22 12:36:38,581 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:38,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1584877911, now seen corresponding path program 1 times [2024-11-22 12:36:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:36:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030410372] [2024-11-22 12:36:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:36:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 12:36:38,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044679727] [2024-11-22 12:36:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:38,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:36:38,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:36:38,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:36:38,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 12:36:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:36:38,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:36:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:36:39,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:36:39,204 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:36:39,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:36:39,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 12:36:39,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-22 12:36:39,412 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:36:39,491 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:36:39,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:36:39 BoogieIcfgContainer [2024-11-22 12:36:39,492 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:36:39,493 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:36:39,493 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:36:39,493 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:36:39,493 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:35:53" (3/4) ... [2024-11-22 12:36:39,495 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:36:39,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:36:39,496 INFO L158 Benchmark]: Toolchain (without parser) took 46728.00ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 118.6MB in the beginning and 829.1MB in the end (delta: -710.6MB). Peak memory consumption was 425.8MB. Max. memory is 16.1GB. [2024-11-22 12:36:39,497 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 174.1MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:36:39,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.82ms. Allocated memory is still 174.1MB. Free memory was 118.2MB in the beginning and 101.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 12:36:39,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.66ms. Allocated memory is still 174.1MB. Free memory was 101.3MB in the beginning and 96.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:36:39,497 INFO L158 Benchmark]: Boogie Preprocessor took 82.82ms. Allocated memory is still 174.1MB. Free memory was 96.8MB in the beginning and 91.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 12:36:39,497 INFO L158 Benchmark]: RCFGBuilder took 661.41ms. Allocated memory is still 174.1MB. Free memory was 91.3MB in the beginning and 52.4MB in the end (delta: 38.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-22 12:36:39,497 INFO L158 Benchmark]: TraceAbstraction took 45612.09ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 51.5MB in the beginning and 829.1MB in the end (delta: -777.7MB). Peak memory consumption was 358.7MB. Max. memory is 16.1GB. [2024-11-22 12:36:39,497 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 1.3GB. Free memory is still 829.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:36:39,498 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 174.1MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.82ms. Allocated memory is still 174.1MB. Free memory was 118.2MB in the beginning and 101.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.66ms. Allocated memory is still 174.1MB. Free memory was 101.3MB in the beginning and 96.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.82ms. Allocated memory is still 174.1MB. Free memory was 96.8MB in the beginning and 91.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 661.41ms. Allocated memory is still 174.1MB. Free memory was 91.3MB in the beginning and 52.4MB in the end (delta: 38.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 45612.09ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 51.5MB in the beginning and 829.1MB in the end (delta: -777.7MB). Peak memory consumption was 358.7MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 1.3GB. Free memory is still 829.1MB. 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 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] double double_Array_0[2][2] = { {0.25, 64.2}, {0.0, 0.0} }; [L25-L27] double double_Array_0[2][2] = { {0.25, 64.2}, {0.0, 0.0} }; [L25-L27] double double_Array_0[2][2] = { {0.25, 64.2}, {0.0, 0.0} }; [L25-L27] double double_Array_0[2][2] = { {0.25, 64.2}, {0.0, 0.0} }; [L25-L27] double double_Array_0[2][2] = { {0.25, 64.2}, {0.0, 0.0} }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 2, 4, -32 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 2, 4, -32 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 2, 4, -32 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 2, 4, -32 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[3] = { 50, 2655070710, 0 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[3] = { 50, 2655070710, 0 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[3] = { 50, 2655070710, 0 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[3] = { 50, 2655070710, 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 36833, 10, 32 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 36833, 10, 32 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 36833, 10, 32 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 36833, 10, 32 }; [L37] unsigned char last_1_BOOL_unsigned_char_Array_0_2_ = 0; [L38] signed long int last_1_signed_long_int_Array_0_2_ = -32; [L39] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 50; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L100] EXPR BOOL_unsigned_char_Array_0[2] [L100] last_1_BOOL_unsigned_char_Array_0_2_ = BOOL_unsigned_char_Array_0[2] [L101] EXPR signed_long_int_Array_0[2] [L101] last_1_signed_long_int_Array_0_2_ = signed_long_int_Array_0[2] [L102] EXPR unsigned_long_int_Array_0[0] [L102] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] double_Array_0[0][0] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[0][0] [L75] EXPR double_Array_0[0][0] >= -922337.2036854776000e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR double_Array_0[0][0] >= -922337.2036854776000e+13F && double_Array_0[0][0] <= -1.0e-20F [L75] EXPR double_Array_0[0][0] [L75] EXPR double_Array_0[0][0] >= -922337.2036854776000e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (double_Array_0[0][0] >= -922337.2036854776000e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (double_Array_0[0][0] >= -922337.2036854776000e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854776000e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854776000e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] double_Array_0[1][0] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[1][0] [L77] EXPR double_Array_0[1][0] >= 4611686.018427387900e+12F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR double_Array_0[1][0] >= 4611686.018427387900e+12F && double_Array_0[1][0] <= -1.0e-20F [L77] EXPR double_Array_0[1][0] [L77] EXPR double_Array_0[1][0] >= 4611686.018427387900e+12F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (double_Array_0[1][0] >= 4611686.018427387900e+12F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (double_Array_0[1][0] >= 4611686.018427387900e+12F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((double_Array_0[1][0] >= 4611686.018427387900e+12F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((double_Array_0[1][0] >= 4611686.018427387900e+12F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] double_Array_0[0][1] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[0][1] [L79] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F [L79] EXPR double_Array_0[0][1] [L79] EXPR double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 4611686.018427387900e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 4611686.018427387900e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 4611686.018427387900e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not((double_Array_0[0][1] >= 0.0F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 4611686.018427387900e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] double_Array_0[1][1] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[1][1] [L81] EXPR double_Array_0[1][1] >= 0.0F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR double_Array_0[1][1] >= 0.0F && double_Array_0[1][1] <= -1.0e-20F [L81] EXPR double_Array_0[1][1] [L81] EXPR double_Array_0[1][1] >= 0.0F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR (double_Array_0[1][1] >= 0.0F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR (double_Array_0[1][1] >= 0.0F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not((double_Array_0[1][1] >= 0.0F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not((double_Array_0[1][1] >= 0.0F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L83] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L86] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 17) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 17) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] unsigned_short_int_Array_0[2] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[2] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_short_int_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_short_int_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L113] RET updateVariables() [L114] CALL step() [L43] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE (unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_ [L44] EXPR double_Array_0[1][0] [L44] EXPR double_Array_0[0][1] [L44] EXPR double_Array_0[1][1] [L44] EXPR double_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] COND FALSE !(((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) [L50] EXPR unsigned_short_int_Array_0[0] [L50] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] COND TRUE unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] EXPR ((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]) [L51] EXPR unsigned_short_int_Array_0[1] [L51] EXPR ((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed_long_int_Array_0[2] = (((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[1]) [L53] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_2_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR unsigned_long_int_Array_0[1] [L56] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR ((((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) < ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1]))) ? (((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) : ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1])) [L56] EXPR ((((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) < ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1]))) ? (((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) : ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] unsigned_long_int_Array_0[0] = ((((((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) < ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1]))) ? (((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) : ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1])))) [L57] EXPR unsigned_long_int_Array_0[0] [L57] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0]; [L58] EXPR unsigned_long_int_Array_0[0] [L58] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[0]; [L59] EXPR signed_long_int_Array_0[2] [L59] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L59] EXPR ((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]) [L59] EXPR signed_long_int_Array_0[2] [L59] EXPR ((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, stepLocal_0=50, stepLocal_1=50, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L59] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L59] COND FALSE !((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > stepLocal_1) [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR signed_long_int_Array_0[2] [L105] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR ((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]) [L105] EXPR signed_long_int_Array_0[2] [L105] EXPR ((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR unsigned_short_int_Array_0[2] [L105] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR ((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1 [L105] EXPR ((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR (((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR (((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L105] EXPR unsigned_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR ((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L105] EXPR double_Array_0[1][0] [L105] EXPR double_Array_0[0][1] [L105] EXPR double_Array_0[1][1] [L105] EXPR double_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR (((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1 [L105] EXPR unsigned_short_int_Array_0[1] [L105] EXPR unsigned_short_int_Array_0[0] [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR (((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR ((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR (((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR ((((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (last_1_BOOL_unsigned_char_Array_0_2_ ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR ((((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (last_1_BOOL_unsigned_char_Array_0_2_ ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR (((((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (last_1_BOOL_unsigned_char_Array_0_2_ ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1)) && ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[1]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR (((((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (last_1_BOOL_unsigned_char_Array_0_2_ ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1)) && ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[1]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR ((((((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (last_1_BOOL_unsigned_char_Array_0_2_ ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1)) && ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[1]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[1]))) : 1)) && (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) < ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1]))) ? (((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) : ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105] EXPR ((((((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (last_1_BOOL_unsigned_char_Array_0_2_ ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1)) && ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[1]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[1]))) : 1)) && (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) < ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1]))) ? (((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) : ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L105-L106] return ((((((((((signed_long_int_Array_0[2]) > (signed_long_int_Array_0[2])) ? (signed_long_int_Array_0[2]) : (signed_long_int_Array_0[2]))) / unsigned_short_int_Array_0[2]) > unsigned_long_int_Array_0[0]) ? ((unsigned_long_int_Array_0[0] == signed_long_int_Array_0[2]) ? (unsigned_long_int_Array_0[2] == ((unsigned long int) 1000000000u)) : (unsigned_long_int_Array_0[2] == ((unsigned long int) 128u))) : 1) && (((unsigned_short_int_Array_0[2] - last_1_unsigned_long_int_Array_0_0_) == last_1_signed_long_int_Array_0_2_) ? ((((double_Array_0[1][0] - double_Array_0[0][1]) - double_Array_0[1][1]) > double_Array_0[0][0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (unsigned_short_int_Array_0[0] - signed_long_int_Array_0[0]))) : 1) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (last_1_BOOL_unsigned_char_Array_0_2_ ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1)) && ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[1]) ? (signed_long_int_Array_0[2] == ((signed long int) (((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))) - unsigned_short_int_Array_0[1]))) : 1)) && (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) < ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1]))) ? (((((last_1_unsigned_long_int_Array_0_0_) < 0 ) ? -(last_1_unsigned_long_int_Array_0_0_) : (last_1_unsigned_long_int_Array_0_0_)))) : ((unsigned_long_int_Array_0[1] - signed_long_int_Array_0[1])))))) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_2_=0, last_1_signed_long_int_Array_0_2_=-32, last_1_unsigned_long_int_Array_0_0_=50, signed_long_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.4s, OverallIterations: 27, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5310 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5259 mSDsluCounter, 28501 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23229 mSDsCounter, 1093 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9399 IncrementalHoareTripleChecker+Invalid, 10492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1093 mSolverCounterUnsat, 5272 mSDtfsCounter, 9399 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1346 GetRequests, 1049 SyntacticMatches, 2 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5645occurred in iteration=26, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 4770 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 5337 NumberOfCodeBlocks, 5337 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 5138 ConstructedInterpolants, 0 QuantifiedInterpolants, 21267 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2652 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 32 InterpolantComputations, 25 PerfectInterpolantSequences, 21786/21888 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-11-22 12:36:39,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb9f80ac793eeca68c7fd49f4ea0c37ec5912db021eb8e0a4597e07f05d1e26c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:36:41,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:36:41,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:36:41,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:36:41,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:36:41,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:36:41,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:36:41,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:36:41,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:36:41,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:36:41,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:36:41,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:36:41,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:36:41,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:36:41,443 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:36:41,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:36:41,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:36:41,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:36:41,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:36:41,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:36:41,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:36:41,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:36:41,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:36:41,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:36:41,447 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:36:41,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:36:41,447 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:36:41,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:36:41,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:36:41,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:36:41,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:36:41,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:36:41,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:36:41,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:36:41,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:36:41,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:36:41,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:36:41,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:36:41,449 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:36:41,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:36:41,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:36:41,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:36:41,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:36:41,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:36:41,451 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb9f80ac793eeca68c7fd49f4ea0c37ec5912db021eb8e0a4597e07f05d1e26c [2024-11-22 12:36:41,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:36:41,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:36:41,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:36:41,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:36:41,721 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:36:41,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i [2024-11-22 12:36:42,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:36:43,161 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:36:43,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i [2024-11-22 12:36:43,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ccf1f58/9a3dfc57f7ef4032ae2457ff7069b1ed/FLAG479874914 [2024-11-22 12:36:43,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ccf1f58/9a3dfc57f7ef4032ae2457ff7069b1ed [2024-11-22 12:36:43,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:36:43,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:36:43,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:36:43,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:36:43,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:36:43,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6ceb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43, skipping insertion in model container [2024-11-22 12:36:43,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:36:43,368 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i[915,928] [2024-11-22 12:36:43,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:36:43,452 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:36:43,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i[915,928] [2024-11-22 12:36:43,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:36:43,524 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:36:43,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43 WrapperNode [2024-11-22 12:36:43,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:36:43,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:36:43,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:36:43,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:36:43,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,577 INFO L138 Inliner]: procedures = 36, calls = 170, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 515 [2024-11-22 12:36:43,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:36:43,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:36:43,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:36:43,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:36:43,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,614 INFO L175 MemorySlicer]: Split 135 memory accesses to 6 slices as follows [2, 16, 32, 28, 21, 36]. 27 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 4, 3, 3, 3]. The 18 writes are split as follows [0, 3, 4, 3, 4, 4]. [2024-11-22 12:36:43,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:36:43,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:36:43,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:36:43,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:36:43,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (1/1) ... [2024-11-22 12:36:43,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:36:43,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:36:43,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:36:43,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:36:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:36:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 12:36:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:36:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:36:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-22 12:36:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-22 12:36:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:36:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:36:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-22 12:36:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-22 12:36:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-22 12:36:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-22 12:36:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 12:36:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 12:36:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 12:36:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 12:36:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-22 12:36:43,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-22 12:36:43,865 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:36:43,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:36:47,183 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-11-22 12:36:47,184 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:36:47,194 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:36:47,194 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:36:47,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:36:47 BoogieIcfgContainer [2024-11-22 12:36:47,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:36:47,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:36:47,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:36:47,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:36:47,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:36:43" (1/3) ... [2024-11-22 12:36:47,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a52632b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:36:47, skipping insertion in model container [2024-11-22 12:36:47,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:36:43" (2/3) ... [2024-11-22 12:36:47,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a52632b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:36:47, skipping insertion in model container [2024-11-22 12:36:47,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:36:47" (3/3) ... [2024-11-22 12:36:47,200 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-6.i [2024-11-22 12:36:47,212 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:36:47,213 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:36:47,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:36:47,267 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;@3f6dc2c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:36:47,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:36:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:36:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 12:36:47,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:47,283 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:47,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:47,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:47,287 INFO L85 PathProgramCache]: Analyzing trace with hash -607756942, now seen corresponding path program 1 times [2024-11-22 12:36:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:36:47,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737644937] [2024-11-22 12:36:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:47,301 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-11-22 12:36:47,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:36:47,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:36:47,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 12:36:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:47,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:36:47,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:36:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-22 12:36:47,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:36:47,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:36:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737644937] [2024-11-22 12:36:47,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737644937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:47,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:47,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:36:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009190774] [2024-11-22 12:36:47,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:47,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:36:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:36:47,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:36:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:36:47,680 INFO L87 Difference]: Start difference. First operand has 122 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:47,710 INFO L93 Difference]: Finished difference Result 237 states and 371 transitions. [2024-11-22 12:36:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:36:47,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2024-11-22 12:36:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:47,721 INFO L225 Difference]: With dead ends: 237 [2024-11-22 12:36:47,721 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 12:36:47,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-11-22 12:36:47,728 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:47,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:36:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 12:36:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-22 12:36:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 97 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:36:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-22 12:36:47,779 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 158 [2024-11-22 12:36:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:47,779 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-22 12:36:47,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-22 12:36:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 12:36:47,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:47,784 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:47,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:36:47,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:36:47,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:47,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1715716112, now seen corresponding path program 1 times [2024-11-22 12:36:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:36:47,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905173965] [2024-11-22 12:36:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:47,999 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-11-22 12:36:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:36:48,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:36:48,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 12:36:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:48,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:36:48,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:36:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-22 12:36:48,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:36:48,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:36:48,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905173965] [2024-11-22 12:36:48,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905173965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:48,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:48,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:36:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271438551] [2024-11-22 12:36:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:48,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:36:48,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:36:48,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:36:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:36:48,346 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:48,411 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2024-11-22 12:36:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:36:48,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2024-11-22 12:36:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:48,413 INFO L225 Difference]: With dead ends: 235 [2024-11-22 12:36:48,413 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 12:36:48,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:36:48,414 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:48,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:36:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 12:36:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-22 12:36:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:36:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2024-11-22 12:36:48,422 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 158 [2024-11-22 12:36:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:48,423 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2024-11-22 12:36:48,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2024-11-22 12:36:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-22 12:36:48,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:48,425 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:48,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 12:36:48,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:36:48,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:48,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:48,628 INFO L85 PathProgramCache]: Analyzing trace with hash -931888242, now seen corresponding path program 1 times [2024-11-22 12:36:48,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:36:48,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687049431] [2024-11-22 12:36:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:48,629 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-11-22 12:36:48,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:36:48,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:36:48,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 12:36:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:48,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:36:48,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:36:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:36:48,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:36:48,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:36:48,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687049431] [2024-11-22 12:36:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687049431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:48,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:48,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:36:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398617292] [2024-11-22 12:36:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:48,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:36:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:36:48,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:36:48,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:36:48,939 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:48,996 INFO L93 Difference]: Finished difference Result 239 states and 348 transitions. [2024-11-22 12:36:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:36:48,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-22 12:36:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:48,999 INFO L225 Difference]: With dead ends: 239 [2024-11-22 12:36:48,999 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 12:36:49,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:36:49,001 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:49,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:36:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 12:36:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-22 12:36:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:36:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2024-11-22 12:36:49,008 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 158 [2024-11-22 12:36:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:49,009 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2024-11-22 12:36:49,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:36:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2024-11-22 12:36:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-22 12:36:49,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:49,011 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:49,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 12:36:49,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:36:49,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:49,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:49,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1353304512, now seen corresponding path program 1 times [2024-11-22 12:36:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:36:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263655262] [2024-11-22 12:36:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:49,215 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-11-22 12:36:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:36:49,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:36:49,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 12:36:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:49,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:36:49,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:36:49,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:36:49,703 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 175 treesize of output 67 [2024-11-22 12:36:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-22 12:36:49,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:36:49,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:36:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263655262] [2024-11-22 12:36:49,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263655262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:49,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:49,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:36:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35138380] [2024-11-22 12:36:49,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:49,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:36:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:36:49,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:36:49,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:36:49,797 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:51,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:36:52,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:36:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:53,658 INFO L93 Difference]: Finished difference Result 242 states and 350 transitions. [2024-11-22 12:36:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:36:53,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 160 [2024-11-22 12:36:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:53,670 INFO L225 Difference]: With dead ends: 242 [2024-11-22 12:36:53,671 INFO L226 Difference]: Without dead ends: 123 [2024-11-22 12:36:53,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:36:53,672 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 145 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:53,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 548 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-22 12:36:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-22 12:36:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-22 12:36:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:36:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2024-11-22 12:36:53,680 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 160 [2024-11-22 12:36:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:53,680 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2024-11-22 12:36:53,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2024-11-22 12:36:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-22 12:36:53,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:53,682 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:53,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 12:36:53,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:36:53,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:53,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1924005690, now seen corresponding path program 1 times [2024-11-22 12:36:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:36:53,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696944820] [2024-11-22 12:36:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:53,884 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-11-22 12:36:53,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:36:53,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:36:53,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 12:36:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:54,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:36:54,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:36:54,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:36:54,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-22 12:36:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-22 12:36:54,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:36:54,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:36:54,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696944820] [2024-11-22 12:36:54,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696944820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:36:54,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:36:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:36:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431490860] [2024-11-22 12:36:54,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:36:54,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:36:54,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:36:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:36:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:36:54,367 INFO L87 Difference]: Start difference. First operand 122 states and 175 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:36:57,263 INFO L93 Difference]: Finished difference Result 241 states and 347 transitions. [2024-11-22 12:36:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:36:57,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2024-11-22 12:36:57,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:36:57,276 INFO L225 Difference]: With dead ends: 241 [2024-11-22 12:36:57,276 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 12:36:57,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:36:57,277 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 138 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-22 12:36:57,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 544 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-22 12:36:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 12:36:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-22 12:36:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:36:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2024-11-22 12:36:57,290 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 162 [2024-11-22 12:36:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:36:57,290 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2024-11-22 12:36:57,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:36:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2024-11-22 12:36:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 12:36:57,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:36:57,297 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:36:57,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 12:36:57,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:36:57,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:36:57,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:36:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash 32113154, now seen corresponding path program 1 times [2024-11-22 12:36:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:36:57,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929931961] [2024-11-22 12:36:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:36:57,500 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-11-22 12:36:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:36:57,502 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:36:57,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 12:36:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:36:57,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 12:36:57,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:36:57,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:36:57,929 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 172 treesize of output 64 [2024-11-22 12:36:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 24 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-22 12:36:57,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:36:58,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:36:58,214 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 110 treesize of output 1 [2024-11-22 12:36:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 12:36:58,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:36:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929931961] [2024-11-22 12:36:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929931961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:36:58,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:36:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-22 12:36:58,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567872421] [2024-11-22 12:36:58,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:36:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:36:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:36:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:36:58,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:36:58,238 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 12 states, 11 states have (on average 9.636363636363637) internal successors, (106), 12 states have internal predecessors, (106), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-22 12:37:01,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-22 12:37:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:37:02,528 INFO L93 Difference]: Finished difference Result 250 states and 356 transitions. [2024-11-22 12:37:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 12:37:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.636363636363637) internal successors, (106), 12 states have internal predecessors, (106), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 164 [2024-11-22 12:37:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:37:02,539 INFO L225 Difference]: With dead ends: 250 [2024-11-22 12:37:02,540 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 12:37:02,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-22 12:37:02,540 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 133 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:37:02,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1125 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-22 12:37:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 12:37:02,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-22 12:37:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:37:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-11-22 12:37:02,551 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 164 [2024-11-22 12:37:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:37:02,551 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-11-22 12:37:02,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.636363636363637) internal successors, (106), 12 states have internal predecessors, (106), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-22 12:37:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-22 12:37:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 12:37:02,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:37:02,553 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:37:02,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 12:37:02,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:37:02,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:37:02,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:37:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1896819072, now seen corresponding path program 1 times [2024-11-22 12:37:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:37:02,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306938272] [2024-11-22 12:37:02,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:37:02,755 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-11-22 12:37:02,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:37:02,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:37:02,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 12:37:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:37:03,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 12:37:03,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:37:03,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:37:03,200 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 173 treesize of output 65 [2024-11-22 12:37:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-11-22 12:37:03,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:37:03,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:37:03,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306938272] [2024-11-22 12:37:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306938272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:37:03,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:37:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:37:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024044884] [2024-11-22 12:37:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:37:03,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:37:03,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:37:03,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:37:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:37:03,226 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:37:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:37:06,078 INFO L93 Difference]: Finished difference Result 238 states and 338 transitions. [2024-11-22 12:37:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:37:06,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 164 [2024-11-22 12:37:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:37:06,091 INFO L225 Difference]: With dead ends: 238 [2024-11-22 12:37:06,091 INFO L226 Difference]: Without dead ends: 121 [2024-11-22 12:37:06,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:37:06,092 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 126 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-22 12:37:06,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 529 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-22 12:37:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-22 12:37:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-22 12:37:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 99 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:37:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2024-11-22 12:37:06,097 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 164 [2024-11-22 12:37:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:37:06,098 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2024-11-22 12:37:06,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 12:37:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2024-11-22 12:37:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-22 12:37:06,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:37:06,099 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:37:06,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 12:37:06,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:37:06,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:37:06,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:37:06,301 INFO L85 PathProgramCache]: Analyzing trace with hash -92829190, now seen corresponding path program 1 times [2024-11-22 12:37:06,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:37:06,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564392711] [2024-11-22 12:37:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:37:06,301 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-11-22 12:37:06,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:37:06,302 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:37:06,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 12:37:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:37:06,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:37:06,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:37:06,685 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 19 treesize of output 7 [2024-11-22 12:37:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:37:06,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:37:06,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:37:06,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564392711] [2024-11-22 12:37:06,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564392711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:37:06,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:37:06,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:37:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971107637] [2024-11-22 12:37:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:37:06,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:37:06,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:37:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:37:06,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:37:06,695 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:37:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:37:06,737 INFO L93 Difference]: Finished difference Result 237 states and 335 transitions. [2024-11-22 12:37:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:37:06,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 166 [2024-11-22 12:37:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:37:06,739 INFO L225 Difference]: With dead ends: 237 [2024-11-22 12:37:06,741 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 12:37:06,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 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-11-22 12:37:06,742 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:37:06,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:37:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 12:37:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-22 12:37:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:37:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2024-11-22 12:37:06,750 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 166 [2024-11-22 12:37:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:37:06,752 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2024-11-22 12:37:06,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:37:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2024-11-22 12:37:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-22 12:37:06,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:37:06,753 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:37:06,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-22 12:37:06,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:37:06,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:37:06,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:37:06,955 INFO L85 PathProgramCache]: Analyzing trace with hash 329872636, now seen corresponding path program 1 times [2024-11-22 12:37:06,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:37:06,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555547844] [2024-11-22 12:37:06,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:37:06,955 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-11-22 12:37:06,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:37:06,956 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:37:06,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 12:37:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:37:07,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:37:07,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:37:07,435 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 19 treesize of output 7 [2024-11-22 12:37:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 12:37:07,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:37:07,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:37:07,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555547844] [2024-11-22 12:37:07,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555547844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:37:07,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:37:07,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:37:07,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910728494] [2024-11-22 12:37:07,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:37:07,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:37:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:37:07,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:37:07,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:37:07,448 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:37:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:37:07,463 INFO L93 Difference]: Finished difference Result 237 states and 333 transitions. [2024-11-22 12:37:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:37:07,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 166 [2024-11-22 12:37:07,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:37:07,464 INFO L225 Difference]: With dead ends: 237 [2024-11-22 12:37:07,464 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 12:37:07,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 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-11-22 12:37:07,465 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 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-11-22 12:37:07,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:37:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 12:37:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-22 12:37:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 12:37:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 167 transitions. [2024-11-22 12:37:07,470 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 167 transitions. Word has length 166 [2024-11-22 12:37:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:37:07,470 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 167 transitions. [2024-11-22 12:37:07,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 12:37:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 167 transitions. [2024-11-22 12:37:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-22 12:37:07,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:37:07,471 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 12:37:07,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-22 12:37:07,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:37:07,672 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:37:07,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:37:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1258475266, now seen corresponding path program 1 times [2024-11-22 12:37:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:37:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618865464] [2024-11-22 12:37:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:37:07,673 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-11-22 12:37:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:37:07,675 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:37:07,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 12:37:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:37:08,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 12:37:08,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:37:08,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-22 12:37:08,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27