./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-46.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 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:31:22,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:31:22,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:31:22,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:31:22,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:31:22,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:31:22,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:31:22,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:31:22,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:31:22,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:31:22,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:31:22,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:31:22,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:31:22,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:31:22,857 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:31:22,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:31:22,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:31:22,858 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:31:22,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:31:22,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:31:22,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:31:22,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:31:22,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:31:22,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:31:22,860 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:31:22,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:31:22,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:31:22,861 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:31:22,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:31:22,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:31:22,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:31:22,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:31:22,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:22,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:31:22,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:31:22,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:31:22,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:31:22,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:31:22,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:31:22,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:31:22,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:31:22,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:31:22,865 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 -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2024-11-09 01:31:23,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:31:23,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:31:23,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:31:23,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:31:23,082 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:31:23,083 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-46.i [2024-11-09 01:31:24,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:31:24,444 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:31:24,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-11-09 01:31:24,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20279ddd7/b59668b0c90141cb8c98d2b3038cb7a9/FLAG9cf7eb3dc [2024-11-09 01:31:24,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20279ddd7/b59668b0c90141cb8c98d2b3038cb7a9 [2024-11-09 01:31:24,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:31:24,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:31:24,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:24,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:31:24,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:31:24,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:24" (1/1) ... [2024-11-09 01:31:24,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc254ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:24, skipping insertion in model container [2024-11-09 01:31:24,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:24" (1/1) ... [2024-11-09 01:31:24,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:31:24,997 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-46.i[916,929] [2024-11-09 01:31:25,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:25,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:31:25,071 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-46.i[916,929] [2024-11-09 01:31:25,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:25,118 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:31:25,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25 WrapperNode [2024-11-09 01:31:25,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:25,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:25,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:31:25,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:31:25,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,174 INFO L138 Inliner]: procedures = 29, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 402 [2024-11-09 01:31:25,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:25,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:31:25,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:31:25,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:31:25,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,207 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-11-09 01:31:25,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:31:25,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:31:25,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:31:25,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:31:25,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (1/1) ... [2024-11-09 01:31:25,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:25,264 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-09 01:31:25,267 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-09 01:31:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:31:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:31:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:31:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:31:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:31:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:31:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:31:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:31:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:31:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:31:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:31:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:31:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:31:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:31:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:31:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:31:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:31:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:31:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:31:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:31:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:31:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:31:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:31:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:31:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:31:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:31:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:31:25,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:31:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:31:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:31:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:31:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:31:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:31:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:31:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:31:25,413 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:31:25,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:31:25,742 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-09 01:31:25,742 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:31:25,753 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:31:25,753 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:31:25,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:25 BoogieIcfgContainer [2024-11-09 01:31:25,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:31:25,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:31:25,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:31:25,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:31:25,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:31:24" (1/3) ... [2024-11-09 01:31:25,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54eb7dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:25, skipping insertion in model container [2024-11-09 01:31:25,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:25" (2/3) ... [2024-11-09 01:31:25,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54eb7dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:25, skipping insertion in model container [2024-11-09 01:31:25,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:25" (3/3) ... [2024-11-09 01:31:25,759 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2024-11-09 01:31:25,771 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:31:25,771 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:31:25,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:31:25,817 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;@54975eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:31:25,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:31:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:31:25,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:25,830 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:31:25,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:25,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1009715545, now seen corresponding path program 1 times [2024-11-09 01:31:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:25,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219726814] [2024-11-09 01:31:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:31:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:31:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:31:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:31:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:31:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:31:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:31:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:31:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:31:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:31:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:26,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:26,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219726814] [2024-11-09 01:31:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219726814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:26,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:26,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:31:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710194590] [2024-11-09 01:31:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:26,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:31:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:26,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:31:26,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:31:26,203 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:26,253 INFO L93 Difference]: Finished difference Result 195 states and 302 transitions. [2024-11-09 01:31:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:31:26,257 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 01:31:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:26,289 INFO L225 Difference]: With dead ends: 195 [2024-11-09 01:31:26,290 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 01:31:26,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-09 01:31:26,298 INFO L432 NwaCegarLoop]: 140 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, 140 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-09 01:31:26,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:31:26,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 01:31:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 01:31:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-09 01:31:26,344 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 116 [2024-11-09 01:31:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:26,345 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-09 01:31:26,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-09 01:31:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:31:26,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:26,349 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:31:26,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:31:26,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash -675339485, now seen corresponding path program 1 times [2024-11-09 01:31:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161220463] [2024-11-09 01:31:26,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:31:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:31:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:31:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:31:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:31:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:31:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:31:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:31:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:31:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:31:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:27,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:27,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161220463] [2024-11-09 01:31:27,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161220463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:27,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:27,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:31:27,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357466352] [2024-11-09 01:31:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:31:27,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:27,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:31:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:31:27,090 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:27,442 INFO L93 Difference]: Finished difference Result 364 states and 528 transitions. [2024-11-09 01:31:27,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:31:27,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 01:31:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:27,445 INFO L225 Difference]: With dead ends: 364 [2024-11-09 01:31:27,446 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 01:31:27,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:31:27,447 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 283 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:27,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 815 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:31:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 01:31:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 265. [2024-11-09 01:31:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 224 states have (on average 1.3973214285714286) internal successors, (313), 225 states have internal predecessors, (313), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:31:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 387 transitions. [2024-11-09 01:31:27,476 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 387 transitions. Word has length 116 [2024-11-09 01:31:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 387 transitions. [2024-11-09 01:31:27,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 387 transitions. [2024-11-09 01:31:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:31:27,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:27,478 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:31:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:31:27,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:27,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1262145499, now seen corresponding path program 1 times [2024-11-09 01:31:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250651525] [2024-11-09 01:31:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:31:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:31:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:31:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:31:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:31:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:31:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:31:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:31:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:31:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:31:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:27,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:27,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250651525] [2024-11-09 01:31:27,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250651525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:31:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015185730] [2024-11-09 01:31:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:27,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:31:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:27,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:31:27,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:31:27,815 INFO L87 Difference]: Start difference. First operand 265 states and 387 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:27,960 INFO L93 Difference]: Finished difference Result 795 states and 1164 transitions. [2024-11-09 01:31:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:31:27,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-09 01:31:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:27,968 INFO L225 Difference]: With dead ends: 795 [2024-11-09 01:31:27,968 INFO L226 Difference]: Without dead ends: 533 [2024-11-09 01:31:27,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:31:27,970 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 125 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:27,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 523 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:31:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-09 01:31:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 301. [2024-11-09 01:31:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 260 states have (on average 1.396153846153846) internal successors, (363), 261 states have internal predecessors, (363), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:31:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 437 transitions. [2024-11-09 01:31:28,011 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 437 transitions. Word has length 116 [2024-11-09 01:31:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:28,012 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 437 transitions. [2024-11-09 01:31:28,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 437 transitions. [2024-11-09 01:31:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:31:28,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:28,014 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:31:28,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:31:28,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:28,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1079912016, now seen corresponding path program 1 times [2024-11-09 01:31:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:28,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182773859] [2024-11-09 01:31:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:28,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:31:28,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966395022] [2024-11-09 01:31:28,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:28,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:28,105 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-09 01:31:28,107 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-09 01:31:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:28,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 01:31:28,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:28,412 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 29 treesize of output 13 [2024-11-09 01:31:28,439 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 29 treesize of output 13 [2024-11-09 01:31:28,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:28,836 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 92 treesize of output 36 [2024-11-09 01:31:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:28,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:31:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:28,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182773859] [2024-11-09 01:31:28,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:31:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966395022] [2024-11-09 01:31:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966395022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:28,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:31:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303331916] [2024-11-09 01:31:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:28,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:31:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:28,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:31:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=44, Unknown=5, NotChecked=0, Total=72 [2024-11-09 01:31:28,988 INFO L87 Difference]: Start difference. First operand 301 states and 437 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:33,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 01:31:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:39,973 INFO L93 Difference]: Finished difference Result 774 states and 1118 transitions. [2024-11-09 01:31:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:31:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-09 01:31:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:39,976 INFO L225 Difference]: With dead ends: 774 [2024-11-09 01:31:39,976 INFO L226 Difference]: Without dead ends: 476 [2024-11-09 01:31:39,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=56, Unknown=5, NotChecked=0, Total=90 [2024-11-09 01:31:39,977 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 241 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 106 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 106 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:39,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 968 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 106 Unknown, 0 Unchecked, 10.3s Time] [2024-11-09 01:31:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-09 01:31:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 329. [2024-11-09 01:31:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 288 states have (on average 1.3923611111111112) internal successors, (401), 289 states have internal predecessors, (401), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:31:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 475 transitions. [2024-11-09 01:31:40,003 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 475 transitions. Word has length 118 [2024-11-09 01:31:40,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:40,003 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 475 transitions. [2024-11-09 01:31:40,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 475 transitions. [2024-11-09 01:31:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:31:40,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:40,006 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:31:40,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:31:40,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:40,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:40,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash -199951662, now seen corresponding path program 1 times [2024-11-09 01:31:40,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:40,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369405539] [2024-11-09 01:31:40,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:31:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:31:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:31:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:31:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:31:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:31:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:31:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:31:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:31:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:31:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:31:41,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369405539] [2024-11-09 01:31:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369405539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:41,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:41,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:31:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535904650] [2024-11-09 01:31:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:41,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:31:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:41,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:31:41,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:31:41,836 INFO L87 Difference]: Start difference. First operand 329 states and 475 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:48,190 INFO L93 Difference]: Finished difference Result 729 states and 1049 transitions. [2024-11-09 01:31:48,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:31:48,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-09 01:31:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:48,193 INFO L225 Difference]: With dead ends: 729 [2024-11-09 01:31:48,193 INFO L226 Difference]: Without dead ends: 399 [2024-11-09 01:31:48,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:31:48,195 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 258 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:48,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 716 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-09 01:31:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-09 01:31:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 329. [2024-11-09 01:31:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 288 states have (on average 1.3784722222222223) internal successors, (397), 289 states have internal predecessors, (397), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:31:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 471 transitions. [2024-11-09 01:31:48,215 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 471 transitions. Word has length 118 [2024-11-09 01:31:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:48,218 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 471 transitions. [2024-11-09 01:31:48,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:31:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 471 transitions. [2024-11-09 01:31:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:31:48,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:48,219 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:31:48,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:31:48,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:48,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash 93460718, now seen corresponding path program 1 times [2024-11-09 01:31:48,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:48,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453264913] [2024-11-09 01:31:48,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:31:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171940716] [2024-11-09 01:31:48,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:48,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:48,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:48,285 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-09 01:31:48,286 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-09 01:31:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:31:48,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:31:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:31:48,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:31:48,717 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:31:48,718 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:31:48,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:31:48,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 01:31:48,923 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 01:31:48,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:31:48,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:31:48 BoogieIcfgContainer [2024-11-09 01:31:48,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:31:48,993 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:31:48,993 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:31:48,993 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:31:48,993 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:25" (3/4) ... [2024-11-09 01:31:48,995 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:31:48,996 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:31:48,996 INFO L158 Benchmark]: Toolchain (without parser) took 24153.37ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 74.9MB in the beginning and 94.7MB in the end (delta: -19.8MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,996 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:31:48,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.68ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 74.6MB in the beginning and 181.9MB in the end (delta: -107.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.89ms. Allocated memory is still 211.8MB. Free memory was 181.9MB in the beginning and 177.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,997 INFO L158 Benchmark]: Boogie Preprocessor took 59.91ms. Allocated memory is still 211.8MB. Free memory was 177.7MB in the beginning and 173.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,997 INFO L158 Benchmark]: RCFGBuilder took 518.09ms. Allocated memory is still 211.8MB. Free memory was 173.2MB in the beginning and 141.0MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,997 INFO L158 Benchmark]: TraceAbstraction took 23236.85ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 139.9MB in the beginning and 95.7MB in the end (delta: 44.2MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2024-11-09 01:31:48,997 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 255.9MB. Free memory was 95.7MB in the beginning and 94.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:31:48,998 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.68ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 74.6MB in the beginning and 181.9MB in the end (delta: -107.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.89ms. Allocated memory is still 211.8MB. Free memory was 181.9MB in the beginning and 177.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.91ms. Allocated memory is still 211.8MB. Free memory was 177.7MB in the beginning and 173.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 518.09ms. Allocated memory is still 211.8MB. Free memory was 173.2MB in the beginning and 141.0MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23236.85ms. Allocated memory was 211.8MB in the beginning and 255.9MB in the end (delta: 44.0MB). Free memory was 139.9MB in the beginning and 95.7MB in the end (delta: 44.2MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 255.9MB. Free memory was 95.7MB in the beginning and 94.7MB in the end (delta: 1.0MB). 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 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L34] unsigned char last_1_BOOL_unsigned_char_Array_0_4_ = 1; [L35] signed short int last_1_signed_short_int_Array_0_1_ = -4; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] EXPR BOOL_unsigned_char_Array_0[4] [L97] last_1_BOOL_unsigned_char_Array_0_4_ = BOOL_unsigned_char_Array_0[4] [L98] EXPR signed_short_int_Array_0[1] [L98] last_1_signed_short_int_Array_0_1_ = signed_short_int_Array_0[1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] double_Array_0[0] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L86] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L89] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[2] >= -128) 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[2] <= 127) 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_char_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_char_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L93] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_short_int_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_short_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET updateVariables() [L110] CALL step() [L39] EXPR signed_short_int_Array_0[0] [L39] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L39] COND FALSE !(last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) [L44] EXPR signed_char_Array_0[2] [L44] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]) [L44] EXPR signed_char_Array_0[2] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] signed long int stepLocal_1 = (((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0])); [L45] EXPR signed_char_Array_0[0] [L45] EXPR signed_char_Array_0[2] [L45] signed long int stepLocal_0 = signed_char_Array_0[0] / signed_char_Array_0[2]; [L46] EXPR double_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L46] COND TRUE (- double_Array_0[0]) >= 16.75 [L47] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L47] COND TRUE stepLocal_0 >= signed_char_Array_0[0] [L48] COND TRUE stepLocal_1 > -32 [L49] BOOL_unsigned_char_Array_0[4] = 0 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L63] EXPR signed_char_Array_0[0] [L63] signed char stepLocal_2 = signed_char_Array_0[0]; [L64] EXPR signed_char_Array_0[0] [L64] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] EXPR signed_char_Array_0[0] | signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=-25] [L64] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] COND TRUE ((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < stepLocal_2 [L65] EXPR signed_short_int_Array_0[0] [L65] signed_short_int_Array_0[1] = (signed_short_int_Array_0[0] - 256) [L69] EXPR signed_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L69] COND FALSE !(1 == signed_char_Array_0[2]) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR double_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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) [L101] EXPR BOOL_unsigned_char_Array_0[4] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101-L102] return (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) ; [L111] RET, EXPR property() [L111] 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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 106 mSolverCounterUnknown, 907 SdHoareTripleChecker+Valid, 16.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 907 mSDsluCounter, 3162 SdHoareTripleChecker+Invalid, 15.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2447 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1367 IncrementalHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 715 mSDtfsCounter, 1367 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 454 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 579 ConstructedInterpolants, 1 QuantifiedInterpolants, 3058 SizeOfPredicates, 3 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1820/1820 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-09 01:31:49,209 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-09 01:31:49,282 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 137 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/11.0.12-open/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-46.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 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:31:50,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:31:50,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:31:50,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:31:50,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:31:50,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:31:50,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:31:50,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:31:50,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:31:50,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:31:50,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:31:50,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:31:50,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:31:50,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:31:50,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:31:50,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:31:50,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:31:50,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:31:50,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:31:50,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:31:50,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:31:50,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:31:50,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:31:50,996 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:31:50,996 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:31:50,996 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:31:50,997 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:31:50,997 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:31:50,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:31:50,998 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:31:50,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:31:50,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:31:50,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:31:50,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:31:50,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:51,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:31:51,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:31:51,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:31:51,005 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:31:51,005 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:31:51,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:31:51,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:31:51,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:31:51,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:31:51,006 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 -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2024-11-09 01:31:51,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:31:51,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:31:51,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:31:51,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:31:51,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:31:51,273 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-46.i [2024-11-09 01:31:52,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:31:52,727 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:31:52,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-11-09 01:31:52,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b21efd1/a90c6eb6d0794c95b7cf90736ef17a96/FLAG0829306dd [2024-11-09 01:31:53,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b21efd1/a90c6eb6d0794c95b7cf90736ef17a96 [2024-11-09 01:31:53,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:31:53,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:31:53,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:53,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:31:53,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:31:53,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647ecbb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53, skipping insertion in model container [2024-11-09 01:31:53,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:31:53,284 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-46.i[916,929] [2024-11-09 01:31:53,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:53,355 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:31:53,365 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-46.i[916,929] [2024-11-09 01:31:53,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:53,427 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:31:53,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53 WrapperNode [2024-11-09 01:31:53,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:53,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:53,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:31:53,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:31:53,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,486 INFO L138 Inliner]: procedures = 33, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 381 [2024-11-09 01:31:53,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:53,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:31:53,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:31:53,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:31:53,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,540 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-11-09 01:31:53,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:31:53,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:31:53,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:31:53,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:31:53,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (1/1) ... [2024-11-09 01:31:53,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:53,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:53,595 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-09 01:31:53,599 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-09 01:31:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:31:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:31:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:31:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:31:53,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:31:53,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:31:53,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:31:53,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:31:53,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:31:53,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:31:53,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:31:53,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:31:53,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:31:53,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:31:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:31:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:31:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:31:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:31:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:31:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:31:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:31:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:31:53,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:31:53,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:31:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:31:53,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:31:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:31:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:31:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:31:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:31:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:31:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:31:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:31:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:31:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:31:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:31:53,782 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:31:53,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:31:54,258 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-09 01:31:54,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:31:54,277 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:31:54,277 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:31:54,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:54 BoogieIcfgContainer [2024-11-09 01:31:54,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:31:54,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:31:54,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:31:54,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:31:54,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:31:53" (1/3) ... [2024-11-09 01:31:54,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1025674c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:54, skipping insertion in model container [2024-11-09 01:31:54,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:53" (2/3) ... [2024-11-09 01:31:54,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1025674c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:54, skipping insertion in model container [2024-11-09 01:31:54,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:54" (3/3) ... [2024-11-09 01:31:54,284 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2024-11-09 01:31:54,296 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:31:54,296 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:31:54,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:31:54,354 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;@4da8243e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:31:54,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:31:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 01:31:54,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:54,371 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:31:54,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:54,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -421847647, now seen corresponding path program 1 times [2024-11-09 01:31:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:31:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124420583] [2024-11-09 01:31:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:54,389 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-09 01:31:54,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:31:54,392 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-09 01:31:54,394 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-09 01:31:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:54,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:31:54,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-09 01:31:54,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:31:54,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:31:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124420583] [2024-11-09 01:31:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124420583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:54,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:54,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:31:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190731319] [2024-11-09 01:31:54,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:54,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:31:54,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:31:54,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:31:54,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:31:54,703 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:54,730 INFO L93 Difference]: Finished difference Result 179 states and 278 transitions. [2024-11-09 01:31:54,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:31:54,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-09 01:31:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:54,738 INFO L225 Difference]: With dead ends: 179 [2024-11-09 01:31:54,738 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 01:31:54,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:31:54,745 INFO L432 NwaCegarLoop]: 128 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, 128 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-09 01:31:54,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:31:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 01:31:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 01:31:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:31:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-09 01:31:54,788 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2024-11-09 01:31:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:54,788 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-09 01:31:54,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:31:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-09 01:31:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 01:31:54,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:54,792 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:31:54,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:31:54,993 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-09 01:31:54,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:54,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash 807549213, now seen corresponding path program 1 times [2024-11-09 01:31:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:31:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302205254] [2024-11-09 01:31:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:54,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:31:54,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:31:54,997 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-09 01:31:54,998 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-09 01:31:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:55,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:31:55,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:55,303 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 21 treesize of output 9 [2024-11-09 01:31:55,831 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 18 treesize of output 10 [2024-11-09 01:31:56,608 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 30 treesize of output 18 [2024-11-09 01:31:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:31:57,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:31:58,330 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 23 treesize of output 15 [2024-11-09 01:31:58,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:31:58,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302205254] [2024-11-09 01:31:58,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302205254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:58,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1369015247] [2024-11-09 01:31:58,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:58,617 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:31:58,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:31:58,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:31:58,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 01:31:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:59,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:31:59,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:59,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:31:59,701 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-09 01:32:00,707 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 18 treesize of output 10 [2024-11-09 01:32:01,561 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 34 treesize of output 22 [2024-11-09 01:32:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-09 01:32:03,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:03,240 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 23 treesize of output 15 [2024-11-09 01:32:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1369015247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:32:03,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:32:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-09 01:32:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309431930] [2024-11-09 01:32:03,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:32:03,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 01:32:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 01:32:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 01:32:03,369 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 24 states, 21 states have (on average 4.714285714285714) internal successors, (99), 22 states have internal predecessors, (99), 8 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-09 01:32:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:18,633 INFO L93 Difference]: Finished difference Result 351 states and 497 transitions. [2024-11-09 01:32:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 01:32:18,634 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.714285714285714) internal successors, (99), 22 states have internal predecessors, (99), 8 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) Word has length 114 [2024-11-09 01:32:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:18,637 INFO L225 Difference]: With dead ends: 351 [2024-11-09 01:32:18,637 INFO L226 Difference]: Without dead ends: 265 [2024-11-09 01:32:18,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=645, Invalid=2325, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 01:32:18,639 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 712 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:18,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1060 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-09 01:32:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-09 01:32:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2024-11-09 01:32:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 168 states have (on average 1.3273809523809523) internal successors, (223), 169 states have internal predecessors, (223), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:32:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 297 transitions. [2024-11-09 01:32:18,673 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 297 transitions. Word has length 114 [2024-11-09 01:32:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:18,674 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 297 transitions. [2024-11-09 01:32:18,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.714285714285714) internal successors, (99), 22 states have internal predecessors, (99), 8 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-09 01:32:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 297 transitions. [2024-11-09 01:32:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 01:32:18,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:18,676 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:18,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 01:32:18,884 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-09 01:32:19,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-09 01:32:19,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:19,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:19,078 INFO L85 PathProgramCache]: Analyzing trace with hash 220743199, now seen corresponding path program 1 times [2024-11-09 01:32:19,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:19,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944204820] [2024-11-09 01:32:19,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:19,079 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-09 01:32:19,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:19,081 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-09 01:32:19,082 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-09 01:32:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:19,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:32:19,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:19,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:32:19,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-11-09 01:32:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:19,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:19,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:19,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944204820] [2024-11-09 01:32:19,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944204820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:19,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:19,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:19,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485521870] [2024-11-09 01:32:19,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:19,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:19,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:19,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:19,329 INFO L87 Difference]: Start difference. First operand 212 states and 297 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:19,617 INFO L93 Difference]: Finished difference Result 491 states and 699 transitions. [2024-11-09 01:32:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:19,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-11-09 01:32:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:19,621 INFO L225 Difference]: With dead ends: 491 [2024-11-09 01:32:19,621 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 01:32:19,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:19,624 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 115 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:19,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 457 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:32:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 01:32:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 228. [2024-11-09 01:32:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 184 states have (on average 1.326086956521739) internal successors, (244), 185 states have internal predecessors, (244), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:32:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2024-11-09 01:32:19,650 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 114 [2024-11-09 01:32:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:19,651 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2024-11-09 01:32:19,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2024-11-09 01:32:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:32:19,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:19,653 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:19,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:19,854 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-09 01:32:19,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:19,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:19,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1417211638, now seen corresponding path program 1 times [2024-11-09 01:32:19,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:19,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399509561] [2024-11-09 01:32:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:19,855 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-09 01:32:19,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:19,857 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-09 01:32:19,857 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-09 01:32:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:20,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:32:20,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:20,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:20,735 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 144 treesize of output 54 [2024-11-09 01:32:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 01:32:20,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:20,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399509561] [2024-11-09 01:32:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399509561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:20,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:20,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:32:20,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313420430] [2024-11-09 01:32:20,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:20,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:32:20,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:32:20,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:32:20,790 INFO L87 Difference]: Start difference. First operand 228 states and 318 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:21,700 INFO L93 Difference]: Finished difference Result 682 states and 954 transitions. [2024-11-09 01:32:21,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:32:21,701 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 01:32:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:21,704 INFO L225 Difference]: With dead ends: 682 [2024-11-09 01:32:21,704 INFO L226 Difference]: Without dead ends: 540 [2024-11-09 01:32:21,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:21,705 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 267 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:21,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1076 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:32:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-09 01:32:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 520. [2024-11-09 01:32:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 425 states have (on average 1.331764705882353) internal successors, (566), 431 states have internal predecessors, (566), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 01:32:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2024-11-09 01:32:21,744 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 116 [2024-11-09 01:32:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:21,744 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2024-11-09 01:32:21,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2024-11-09 01:32:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:32:21,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:21,747 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:21,754 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-09 01:32:21,950 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-09 01:32:21,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:21,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash 407816570, now seen corresponding path program 1 times [2024-11-09 01:32:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:21,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817181750] [2024-11-09 01:32:21,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:21,952 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-09 01:32:21,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:21,955 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-09 01:32:21,955 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-09 01:32:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:22,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:32:22,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:22,135 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 23 treesize of output 11 [2024-11-09 01:32:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:22,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:22,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:22,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817181750] [2024-11-09 01:32:22,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817181750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:22,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:22,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459383158] [2024-11-09 01:32:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:22,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:22,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:22,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:22,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:22,286 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:23,450 INFO L93 Difference]: Finished difference Result 1032 states and 1450 transitions. [2024-11-09 01:32:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-09 01:32:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:23,458 INFO L225 Difference]: With dead ends: 1032 [2024-11-09 01:32:23,458 INFO L226 Difference]: Without dead ends: 688 [2024-11-09 01:32:23,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:23,460 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 80 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:23,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 408 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 01:32:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-09 01:32:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 520. [2024-11-09 01:32:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 425 states have (on average 1.3247058823529412) internal successors, (563), 431 states have internal predecessors, (563), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 01:32:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 723 transitions. [2024-11-09 01:32:23,495 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 723 transitions. Word has length 116 [2024-11-09 01:32:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:23,496 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 723 transitions. [2024-11-09 01:32:23,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 723 transitions. [2024-11-09 01:32:23,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:32:23,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:23,498 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:23,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:23,699 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-09 01:32:23,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:23,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash 14789560, now seen corresponding path program 1 times [2024-11-09 01:32:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:23,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476606592] [2024-11-09 01:32:23,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:23,701 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-09 01:32:23,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:23,702 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-09 01:32:23,703 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-09 01:32:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:23,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:32:23,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:23,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:23,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:23,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476606592] [2024-11-09 01:32:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476606592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:23,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:32:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808256957] [2024-11-09 01:32:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:23,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:23,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:23,877 INFO L87 Difference]: Start difference. First operand 520 states and 723 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:23,931 INFO L93 Difference]: Finished difference Result 927 states and 1302 transitions. [2024-11-09 01:32:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:23,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-09 01:32:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:23,935 INFO L225 Difference]: With dead ends: 927 [2024-11-09 01:32:23,935 INFO L226 Difference]: Without dead ends: 535 [2024-11-09 01:32:23,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:23,937 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:23,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-09 01:32:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-11-09 01:32:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 440 states have (on average 1.3136363636363637) internal successors, (578), 446 states have internal predecessors, (578), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 01:32:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 738 transitions. [2024-11-09 01:32:23,974 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 738 transitions. Word has length 116 [2024-11-09 01:32:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:23,975 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 738 transitions. [2024-11-09 01:32:23,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 738 transitions. [2024-11-09 01:32:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:32:23,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:23,976 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:23,985 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-09 01:32:24,176 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-09 01:32:24,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:24,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash 316892812, now seen corresponding path program 1 times [2024-11-09 01:32:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015807180] [2024-11-09 01:32:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:24,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:32:24,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:24,180 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-09 01:32:24,181 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-09 01:32:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:24,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:32:24,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 01:32:24,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:24,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015807180] [2024-11-09 01:32:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015807180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:24,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:24,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:32:24,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546746706] [2024-11-09 01:32:24,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:24,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:32:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:24,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:32:24,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:32:24,324 INFO L87 Difference]: Start difference. First operand 535 states and 738 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:24,375 INFO L93 Difference]: Finished difference Result 993 states and 1375 transitions. [2024-11-09 01:32:24,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:32:24,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-09 01:32:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:24,378 INFO L225 Difference]: With dead ends: 993 [2024-11-09 01:32:24,378 INFO L226 Difference]: Without dead ends: 535 [2024-11-09 01:32:24,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 113 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-09 01:32:24,379 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:24,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:32:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-09 01:32:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-11-09 01:32:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 440 states have (on average 1.3068181818181819) internal successors, (575), 446 states have internal predecessors, (575), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 01:32:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 735 transitions. [2024-11-09 01:32:24,409 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 735 transitions. Word has length 116 [2024-11-09 01:32:24,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:24,410 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 735 transitions. [2024-11-09 01:32:24,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 735 transitions. [2024-11-09 01:32:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:32:24,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:24,411 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:24,419 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-09 01:32:24,611 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-09 01:32:24,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:24,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash 298100019, now seen corresponding path program 1 times [2024-11-09 01:32:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549213051] [2024-11-09 01:32:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:24,613 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-09 01:32:24,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:24,614 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-09 01:32:24,614 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-09 01:32:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:24,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:32:24,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:24,776 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 21 treesize of output 9 [2024-11-09 01:32:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:24,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:24,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549213051] [2024-11-09 01:32:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549213051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:24,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:24,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:32:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282383743] [2024-11-09 01:32:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:24,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:32:24,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:24,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:32:24,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:32:24,942 INFO L87 Difference]: Start difference. First operand 535 states and 735 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:25,243 INFO L93 Difference]: Finished difference Result 1593 states and 2212 transitions. [2024-11-09 01:32:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:25,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-09 01:32:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:25,248 INFO L225 Difference]: With dead ends: 1593 [2024-11-09 01:32:25,248 INFO L226 Difference]: Without dead ends: 1186 [2024-11-09 01:32:25,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:32:25,249 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 237 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:25,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 333 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:32:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2024-11-09 01:32:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1110. [2024-11-09 01:32:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 963 states have (on average 1.343717549325026) internal successors, (1294), 973 states have internal predecessors, (1294), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-09 01:32:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1546 transitions. [2024-11-09 01:32:25,314 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1546 transitions. Word has length 117 [2024-11-09 01:32:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:25,314 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1546 transitions. [2024-11-09 01:32:25,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1546 transitions. [2024-11-09 01:32:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:32:25,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:25,315 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:25,323 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-09 01:32:25,516 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-09 01:32:25,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:25,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2103538353, now seen corresponding path program 1 times [2024-11-09 01:32:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:25,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667636723] [2024-11-09 01:32:25,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:25,517 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-09 01:32:25,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:25,520 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-09 01:32:25,521 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-09 01:32:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:25,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 01:32:25,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:25,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:32:25,889 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 33 treesize of output 28 [2024-11-09 01:32:26,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:26,048 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 43 treesize of output 41 [2024-11-09 01:32:26,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:26,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 44 [2024-11-09 01:32:26,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:26,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 55 [2024-11-09 01:32:27,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:27,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 48 [2024-11-09 01:32:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 108 proven. 72 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 01:32:27,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:27,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667636723] [2024-11-09 01:32:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667636723] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:32:27,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:32:27,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 18 [2024-11-09 01:32:27,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431973967] [2024-11-09 01:32:27,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:27,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:27,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:27,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:27,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:32:27,323 INFO L87 Difference]: Start difference. First operand 1110 states and 1546 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:27,687 INFO L93 Difference]: Finished difference Result 2110 states and 2954 transitions. [2024-11-09 01:32:27,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:32:27,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-09 01:32:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:27,692 INFO L225 Difference]: With dead ends: 2110 [2024-11-09 01:32:27,692 INFO L226 Difference]: Without dead ends: 1132 [2024-11-09 01:32:27,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:32:27,695 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 43 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:27,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 694 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:32:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-09 01:32:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1100. [2024-11-09 01:32:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 953 states have (on average 1.347324239244491) internal successors, (1284), 963 states have internal predecessors, (1284), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-09 01:32:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1536 transitions. [2024-11-09 01:32:27,736 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1536 transitions. Word has length 117 [2024-11-09 01:32:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:27,736 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1536 transitions. [2024-11-09 01:32:27,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1536 transitions. [2024-11-09 01:32:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:32:27,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:27,743 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:27,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:27,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:32:27,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:27,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:27,948 INFO L85 PathProgramCache]: Analyzing trace with hash -185295277, now seen corresponding path program 1 times [2024-11-09 01:32:27,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:27,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131538922] [2024-11-09 01:32:27,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:27,949 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-09 01:32:27,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:27,950 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:32:27,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 01:32:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:28,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:32:28,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:28,191 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 21 treesize of output 9 [2024-11-09 01:32:28,578 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 18 treesize of output 10 [2024-11-09 01:32:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:32:30,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:32:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:30,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131538922] [2024-11-09 01:32:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131538922] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:32:30,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:32:30,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-11-09 01:32:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315015745] [2024-11-09 01:32:30,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:30,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:32:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:30,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:32:30,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:32:30,929 INFO L87 Difference]: Start difference. First operand 1100 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:31,266 INFO L93 Difference]: Finished difference Result 2938 states and 4112 transitions. [2024-11-09 01:32:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:32:31,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-09 01:32:31,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:31,273 INFO L225 Difference]: With dead ends: 2938 [2024-11-09 01:32:31,273 INFO L226 Difference]: Without dead ends: 1970 [2024-11-09 01:32:31,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:32:31,275 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 132 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:31,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 404 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:32:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2024-11-09 01:32:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1486. [2024-11-09 01:32:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1339 states have (on average 1.368185212845407) internal successors, (1832), 1349 states have internal predecessors, (1832), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-09 01:32:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2084 transitions. [2024-11-09 01:32:31,340 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2084 transitions. Word has length 118 [2024-11-09 01:32:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:31,340 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 2084 transitions. [2024-11-09 01:32:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2084 transitions. [2024-11-09 01:32:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:32:31,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:31,342 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:31,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 01:32:31,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:32:31,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:31,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash -994641903, now seen corresponding path program 1 times [2024-11-09 01:32:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:31,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168311198] [2024-11-09 01:32:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:31,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:32:31,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:31,545 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:32:31,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 01:32:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:31,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:32:31,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:31,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:32:31,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-11-09 01:32:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:31,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:31,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:31,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168311198] [2024-11-09 01:32:31,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168311198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:31,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:31,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:32:31,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600555376] [2024-11-09 01:32:31,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:31,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:31,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:31,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:31,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:31,780 INFO L87 Difference]: Start difference. First operand 1486 states and 2084 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:31,945 INFO L93 Difference]: Finished difference Result 3189 states and 4487 transitions. [2024-11-09 01:32:31,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:32:31,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-09 01:32:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:31,952 INFO L225 Difference]: With dead ends: 3189 [2024-11-09 01:32:31,952 INFO L226 Difference]: Without dead ends: 1845 [2024-11-09 01:32:31,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 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-09 01:32:31,954 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 111 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:31,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 885 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:32:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2024-11-09 01:32:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1771. [2024-11-09 01:32:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1552 states have (on average 1.3421391752577319) internal successors, (2083), 1569 states have internal predecessors, (2083), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 171 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-09 01:32:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2459 transitions. [2024-11-09 01:32:32,034 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2459 transitions. Word has length 118 [2024-11-09 01:32:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:32,034 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2459 transitions. [2024-11-09 01:32:32,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2459 transitions. [2024-11-09 01:32:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:32:32,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:32,036 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:32,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:32,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:32:32,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:32,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:32,237 INFO L85 PathProgramCache]: Analyzing trace with hash -434022304, now seen corresponding path program 1 times [2024-11-09 01:32:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:32,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97386600] [2024-11-09 01:32:32,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:32,238 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-09 01:32:32,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:32,239 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:32:32,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 01:32:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:32,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:32:32,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:32,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 01:32:32,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-11-09 01:32:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:32,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:32,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97386600] [2024-11-09 01:32:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97386600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:32,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:32,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:32:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211148421] [2024-11-09 01:32:32,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:32,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:32:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:32:32,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:32:32,485 INFO L87 Difference]: Start difference. First operand 1771 states and 2459 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:32,840 INFO L93 Difference]: Finished difference Result 3498 states and 4860 transitions. [2024-11-09 01:32:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:32:32,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-09 01:32:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:32,849 INFO L225 Difference]: With dead ends: 3498 [2024-11-09 01:32:32,849 INFO L226 Difference]: Without dead ends: 1869 [2024-11-09 01:32:32,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:32:32,852 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:32,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 680 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:32:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2024-11-09 01:32:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1835. [2024-11-09 01:32:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1616 states have (on average 1.328589108910891) internal successors, (2147), 1633 states have internal predecessors, (2147), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 171 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-09 01:32:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2523 transitions. [2024-11-09 01:32:32,953 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2523 transitions. Word has length 118 [2024-11-09 01:32:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:32,956 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2523 transitions. [2024-11-09 01:32:32,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2523 transitions. [2024-11-09 01:32:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:32:32,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:32,958 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:32,966 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 (14)] Ended with exit code 0 [2024-11-09 01:32:33,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:32:33,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:33,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1020828318, now seen corresponding path program 1 times [2024-11-09 01:32:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:33,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259637766] [2024-11-09 01:32:33,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:33,160 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-09 01:32:33,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:33,161 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:32:33,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 01:32:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:33,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:32:33,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:34,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:34,016 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 145 treesize of output 55 [2024-11-09 01:32:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 01:32:35,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:35,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:35,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259637766] [2024-11-09 01:32:35,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259637766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:35,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:35,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:32:35,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740260194] [2024-11-09 01:32:35,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:35,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:32:35,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:35,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:32:35,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:32:35,964 INFO L87 Difference]: Start difference. First operand 1835 states and 2523 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:37,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:42,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:45,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:53,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:56,912 INFO L93 Difference]: Finished difference Result 3437 states and 4714 transitions. [2024-11-09 01:32:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:32:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-09 01:32:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:56,919 INFO L225 Difference]: With dead ends: 3437 [2024-11-09 01:32:56,919 INFO L226 Difference]: Without dead ends: 1744 [2024-11-09 01:32:56,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:56,921 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 278 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:56,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 544 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 20.8s Time] [2024-11-09 01:32:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2024-11-09 01:32:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1584. [2024-11-09 01:32:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1382 states have (on average 1.3205499276411) internal successors, (1825), 1396 states have internal predecessors, (1825), 170 states have call successors, (170), 31 states have call predecessors, (170), 31 states have return successors, (170), 156 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-09 01:32:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2165 transitions. [2024-11-09 01:32:56,988 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2165 transitions. Word has length 118 [2024-11-09 01:32:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:56,989 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2165 transitions. [2024-11-09 01:32:56,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 01:32:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2165 transitions. [2024-11-09 01:32:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:32:56,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:56,990 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:56,999 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 (15)] Ended with exit code 0 [2024-11-09 01:32:57,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:32:57,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:57,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1503648465, now seen corresponding path program 1 times [2024-11-09 01:32:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355304301] [2024-11-09 01:32:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:57,192 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-09 01:32:57,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:57,193 INFO L229 MonitoredProcess]: Starting monitored process 16 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-09 01:32:57,193 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 (16)] Waiting until timeout for monitored process [2024-11-09 01:32:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:57,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:32:57,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:57,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 01:32:57,396 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 23 treesize of output 23 [2024-11-09 01:32:57,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:32:57,458 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 72 treesize of output 42 [2024-11-09 01:32:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 01:32:57,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:32:57,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:32:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355304301] [2024-11-09 01:32:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355304301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:57,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:32:57,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:32:57,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104960797] [2024-11-09 01:32:57,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:57,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:32:57,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:32:57,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:32:57,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:32:57,491 INFO L87 Difference]: Start difference. First operand 1584 states and 2165 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:32:57,719 INFO L93 Difference]: Finished difference Result 3088 states and 4225 transitions. [2024-11-09 01:32:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:32:57,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-09 01:32:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:32:57,725 INFO L225 Difference]: With dead ends: 3088 [2024-11-09 01:32:57,725 INFO L226 Difference]: Without dead ends: 1650 [2024-11-09 01:32:57,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:32:57,727 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 88 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:32:57,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 927 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:32:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-11-09 01:32:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1648. [2024-11-09 01:32:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1442 states have (on average 1.3072122052704578) internal successors, (1885), 1456 states have internal predecessors, (1885), 170 states have call successors, (170), 35 states have call predecessors, (170), 35 states have return successors, (170), 156 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-09 01:32:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2225 transitions. [2024-11-09 01:32:57,799 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2225 transitions. Word has length 118 [2024-11-09 01:32:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:32:57,799 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2225 transitions. [2024-11-09 01:32:57,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 01:32:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2225 transitions. [2024-11-09 01:32:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:32:57,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:32:57,802 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:32:57,810 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 (16)] Forceful destruction successful, exit code 0 [2024-11-09 01:32:58,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-09 01:32:58,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:32:58,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:32:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash 694301839, now seen corresponding path program 1 times [2024-11-09 01:32:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:32:58,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713774372] [2024-11-09 01:32:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:58,007 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-09 01:32:58,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:32:58,008 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:32:58,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process