./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:14:04,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:14:04,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:14:04,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:14:04,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:14:04,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:14:04,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:14:04,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:14:04,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:14:04,871 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:14:04,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:14:04,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:14:04,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:14:04,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:14:04,872 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:14:04,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:14:04,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:14:04,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:14:04,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:14:04,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:14:04,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:14:04,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:14:04,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:14:04,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:14:04,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:14:04,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:14:04,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:14:04,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:14:04,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:14:04,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:14:04,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:14:04,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:14:04,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:04,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:14:04,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:14:04,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:14:04,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:14:04,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:14:04,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:14:04,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:14:04,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:14:04,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:14:04,884 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea [2024-10-11 13:14:05,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:14:05,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:14:05,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:14:05,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:14:05,199 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:14:05,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2024-10-11 13:14:06,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:14:06,887 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:14:06,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2024-10-11 13:14:06,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5402225dd/a7fb8dfc06b240038a01010a6b4dd6b8/FLAGeff922e02 [2024-10-11 13:14:06,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5402225dd/a7fb8dfc06b240038a01010a6b4dd6b8 [2024-10-11 13:14:06,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:14:06,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:14:06,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:06,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:14:06,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:14:06,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:06" (1/1) ... [2024-10-11 13:14:06,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27aaa93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:06, skipping insertion in model container [2024-10-11 13:14:06,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:06" (1/1) ... [2024-10-11 13:14:06,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:14:07,129 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i[916,929] [2024-10-11 13:14:07,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:07,212 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:14:07,223 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i[916,929] [2024-10-11 13:14:07,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:07,291 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:14:07,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07 WrapperNode [2024-10-11 13:14:07,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:07,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:07,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:14:07,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:14:07,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,359 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 626 [2024-10-11 13:14:07,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:07,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:14:07,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:14:07,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:14:07,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,406 INFO L175 MemorySlicer]: Split 156 memory accesses to 7 slices as follows [2, 14, 89, 3, 21, 22, 5]. 57 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 7, 1, 3, 2, 1]. The 19 writes are split as follows [0, 2, 7, 1, 5, 3, 1]. [2024-10-11 13:14:07,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:14:07,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:14:07,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:14:07,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:14:07,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (1/1) ... [2024-10-11 13:14:07,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:07,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:07,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:14:07,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:14:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:14:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:14:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:14:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:14:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:14:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:14:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:14:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:14:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:14:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:14:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:14:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:14:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:14:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:14:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:14:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:14:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:14:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:14:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:14:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:14:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:14:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:14:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:14:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:14:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:14:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:14:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:14:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:14:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:14:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:14:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:14:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:14:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:14:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:14:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:14:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:14:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:14:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:14:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:14:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:14:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:14:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:14:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:14:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:14:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:14:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:14:07,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:14:07,803 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:14:07,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:14:08,404 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2024-10-11 13:14:08,405 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:14:08,444 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:14:08,444 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:14:08,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:08 BoogieIcfgContainer [2024-10-11 13:14:08,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:14:08,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:14:08,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:14:08,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:14:08,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:14:06" (1/3) ... [2024-10-11 13:14:08,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c39eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:08, skipping insertion in model container [2024-10-11 13:14:08,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:07" (2/3) ... [2024-10-11 13:14:08,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c39eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:08, skipping insertion in model container [2024-10-11 13:14:08,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:08" (3/3) ... [2024-10-11 13:14:08,456 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-17.i [2024-10-11 13:14:08,470 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:14:08,470 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:14:08,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:14:08,531 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;@53c4985, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:14:08,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:14:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:14:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:14:08,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:08,554 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:08,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:08,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash 317667774, now seen corresponding path program 1 times [2024-10-11 13:14:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:08,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464427641] [2024-10-11 13:14:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:08,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:08,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:08,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:08,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:08,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:14:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:08,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:08,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:14:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:14:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464427641] [2024-10-11 13:14:09,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464427641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:09,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:09,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:14:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911882272] [2024-10-11 13:14:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:09,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:14:09,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:14:09,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:09,132 INFO L87 Difference]: Start difference. First operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:09,194 INFO L93 Difference]: Finished difference Result 271 states and 428 transitions. [2024-10-11 13:14:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:14:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-11 13:14:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:09,207 INFO L225 Difference]: With dead ends: 271 [2024-10-11 13:14:09,207 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 13:14:09,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:09,215 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:09,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 13:14:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-11 13:14:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.452991452991453) internal successors, (170), 117 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:14:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-11 13:14:09,281 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 136 [2024-10-11 13:14:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:09,281 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-11 13:14:09,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-11 13:14:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:14:09,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:09,289 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:09,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:14:09,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:09,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:09,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1627642390, now seen corresponding path program 1 times [2024-10-11 13:14:09,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:09,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325374499] [2024-10-11 13:14:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:14:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:14:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:14:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:09,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:09,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325374499] [2024-10-11 13:14:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325374499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:09,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110481803] [2024-10-11 13:14:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:09,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:09,683 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:09,754 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2024-10-11 13:14:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:09,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-11 13:14:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:09,760 INFO L225 Difference]: With dead ends: 271 [2024-10-11 13:14:09,760 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 13:14:09,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:09,763 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:09,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 13:14:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-11 13:14:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:14:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2024-10-11 13:14:09,789 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 136 [2024-10-11 13:14:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:09,791 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2024-10-11 13:14:09,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2024-10-11 13:14:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:14:09,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:09,793 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:09,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:14:09,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:09,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1599142100, now seen corresponding path program 1 times [2024-10-11 13:14:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334698476] [2024-10-11 13:14:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:14:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:14:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:14:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:10,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:10,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334698476] [2024-10-11 13:14:10,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334698476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:10,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:10,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005292581] [2024-10-11 13:14:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:10,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:10,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:10,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:10,140 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:10,185 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2024-10-11 13:14:10,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:10,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-10-11 13:14:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:10,188 INFO L225 Difference]: With dead ends: 275 [2024-10-11 13:14:10,188 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 13:14:10,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:10,190 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:10,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:10,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 13:14:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-11 13:14:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:14:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2024-10-11 13:14:10,200 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 136 [2024-10-11 13:14:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:10,201 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2024-10-11 13:14:10,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2024-10-11 13:14:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 13:14:10,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:10,203 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:10,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:14:10,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:10,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:10,204 INFO L85 PathProgramCache]: Analyzing trace with hash 142937969, now seen corresponding path program 1 times [2024-10-11 13:14:10,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:10,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497805425] [2024-10-11 13:14:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:10,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:14:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:14:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:14:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:10,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:10,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497805425] [2024-10-11 13:14:10,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497805425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:10,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:14:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580804085] [2024-10-11 13:14:10,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:10,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:14:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:10,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:14:10,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:14:10,842 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:10,953 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2024-10-11 13:14:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:14:10,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-11 13:14:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:10,957 INFO L225 Difference]: With dead ends: 280 [2024-10-11 13:14:10,957 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 13:14:10,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:10,959 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 89 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:10,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 661 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:14:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 13:14:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-10-11 13:14:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:14:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-10-11 13:14:10,971 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 138 [2024-10-11 13:14:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:10,974 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-10-11 13:14:10,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-10-11 13:14:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 13:14:10,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:10,975 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:10,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:14:10,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:10,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:10,976 INFO L85 PathProgramCache]: Analyzing trace with hash -666408657, now seen corresponding path program 1 times [2024-10-11 13:14:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409876443] [2024-10-11 13:14:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:14:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:14:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:14:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:11,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:11,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409876443] [2024-10-11 13:14:11,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409876443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:11,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:11,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:14:11,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286066502] [2024-10-11 13:14:11,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:11,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:14:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:11,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:14:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:11,981 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:12,278 INFO L93 Difference]: Finished difference Result 564 states and 833 transitions. [2024-10-11 13:14:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:12,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-11 13:14:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:12,282 INFO L225 Difference]: With dead ends: 564 [2024-10-11 13:14:12,282 INFO L226 Difference]: Without dead ends: 424 [2024-10-11 13:14:12,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:14:12,285 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 333 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:12,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1541 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-11 13:14:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 418. [2024-10-11 13:14:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 366 states have (on average 1.4289617486338797) internal successors, (523), 366 states have internal predecessors, (523), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:14:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2024-10-11 13:14:12,334 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 138 [2024-10-11 13:14:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:12,337 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2024-10-11 13:14:12,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2024-10-11 13:14:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 13:14:12,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:12,339 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:12,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:14:12,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:12,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1463924049, now seen corresponding path program 1 times [2024-10-11 13:14:12,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:12,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230204156] [2024-10-11 13:14:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:14:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:14:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:14:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:12,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230204156] [2024-10-11 13:14:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230204156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:12,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:12,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908919004] [2024-10-11 13:14:12,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:12,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:12,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:12,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:12,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:12,947 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:13,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:13,086 INFO L93 Difference]: Finished difference Result 1044 states and 1535 transitions. [2024-10-11 13:14:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:14:13,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2024-10-11 13:14:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:13,091 INFO L225 Difference]: With dead ends: 1044 [2024-10-11 13:14:13,091 INFO L226 Difference]: Without dead ends: 627 [2024-10-11 13:14:13,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:13,094 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 90 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:13,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 924 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:14:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-11 13:14:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 622. [2024-10-11 13:14:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 561 states have (on average 1.429590017825312) internal successors, (802), 564 states have internal predecessors, (802), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:14:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 910 transitions. [2024-10-11 13:14:13,137 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 910 transitions. Word has length 138 [2024-10-11 13:14:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:13,138 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 910 transitions. [2024-10-11 13:14:13,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 910 transitions. [2024-10-11 13:14:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:14:13,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:13,140 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:13,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:14:13,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:13,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash 565057346, now seen corresponding path program 1 times [2024-10-11 13:14:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:13,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517530527] [2024-10-11 13:14:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:14:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:14:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:14:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517530527] [2024-10-11 13:14:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517530527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:13,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:13,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:14:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482543514] [2024-10-11 13:14:13,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:13,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:14:13,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:13,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:14:13,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:13,959 INFO L87 Difference]: Start difference. First operand 622 states and 910 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:14,173 INFO L93 Difference]: Finished difference Result 1042 states and 1524 transitions. [2024-10-11 13:14:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:14:14,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-10-11 13:14:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:14,180 INFO L225 Difference]: With dead ends: 1042 [2024-10-11 13:14:14,182 INFO L226 Difference]: Without dead ends: 835 [2024-10-11 13:14:14,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 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-10-11 13:14:14,184 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 192 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:14,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1713 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:14:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-10-11 13:14:14,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 419. [2024-10-11 13:14:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 378 states have (on average 1.4285714285714286) internal successors, (540), 380 states have internal predecessors, (540), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:14:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 612 transitions. [2024-10-11 13:14:14,217 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 612 transitions. Word has length 139 [2024-10-11 13:14:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:14,218 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 612 transitions. [2024-10-11 13:14:14,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 612 transitions. [2024-10-11 13:14:14,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:14:14,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:14,221 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:14,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:14:14,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:14,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2029089083, now seen corresponding path program 1 times [2024-10-11 13:14:14,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:14,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461912848] [2024-10-11 13:14:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:14:14,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:14:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:14:14,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:14:14,420 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:14:14,421 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:14:14,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:14:14,426 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:14,556 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:14:14,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:14:14 BoogieIcfgContainer [2024-10-11 13:14:14,559 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:14:14,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:14:14,560 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:14:14,560 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:14:14,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:08" (3/4) ... [2024-10-11 13:14:14,562 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:14:14,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:14:14,564 INFO L158 Benchmark]: Toolchain (without parser) took 7643.92ms. Allocated memory was 159.4MB in the beginning and 316.7MB in the end (delta: 157.3MB). Free memory was 111.4MB in the beginning and 118.9MB in the end (delta: -7.4MB). Peak memory consumption was 149.1MB. Max. memory is 16.1GB. [2024-10-11 13:14:14,564 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:14:14,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.12ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 94.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:14:14,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.87ms. Allocated memory is still 159.4MB. Free memory was 94.5MB in the beginning and 89.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:14:14,565 INFO L158 Benchmark]: Boogie Preprocessor took 98.71ms. Allocated memory is still 159.4MB. Free memory was 89.7MB in the beginning and 83.7MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:14:14,565 INFO L158 Benchmark]: RCFGBuilder took 984.95ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 89.7MB in the end (delta: -5.9MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-10-11 13:14:14,566 INFO L158 Benchmark]: TraceAbstraction took 6110.24ms. Allocated memory was 159.4MB in the beginning and 316.7MB in the end (delta: 157.3MB). Free memory was 88.9MB in the beginning and 118.9MB in the end (delta: -30.0MB). Peak memory consumption was 128.9MB. Max. memory is 16.1GB. [2024-10-11 13:14:14,566 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 316.7MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:14:14,567 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 96.5MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.12ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 94.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.87ms. Allocated memory is still 159.4MB. Free memory was 94.5MB in the beginning and 89.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.71ms. Allocated memory is still 159.4MB. Free memory was 89.7MB in the beginning and 83.7MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 984.95ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 89.7MB in the end (delta: -5.9MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6110.24ms. Allocated memory was 159.4MB in the beginning and 316.7MB in the end (delta: 157.3MB). Free memory was 88.9MB in the beginning and 118.9MB in the end (delta: -30.0MB). Peak memory consumption was 128.9MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 316.7MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L28-L30] float float_Array_0[1] = { 128.4 }; [L28-L30] float float_Array_0[1] = { 128.4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 100 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 100 }; [L40] unsigned char last_1_unsigned_char_Array_0_1_ = 16; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR unsigned_char_Array_0[1] [L102] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] double_Array_0[0] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR (double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR (double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] double_Array_0[2] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] double_Array_0[3] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[3] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F [L86] EXPR double_Array_0[3] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] double_Array_0[4] = __VERIFIER_nondet_double() [L88] EXPR double_Array_0[4] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F [L88] EXPR double_Array_0[4] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] CALL assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] RET assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] double_Array_0[5] = __VERIFIER_nondet_double() [L90] EXPR double_Array_0[5] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F [L90] EXPR double_Array_0[5] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR (double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR (double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] CALL assume_abort_if_not((double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] RET assume_abort_if_not((double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L92] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L95] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L97] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L44] unsigned_long_int_Array_0[0] = last_1_unsigned_char_Array_0_1_ [L45] EXPR unsigned_long_int_Array_0[0] [L45] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0]; [L46] EXPR signed_short_int_Array_0[0] [L46] signed short int stepLocal_0 = signed_short_int_Array_0[0]; [L47] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] COND FALSE !(stepLocal_0 >= signed_short_int_Array_0[1]) [L54] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L57] EXPR double_Array_0[1] [L57] EXPR double_Array_0[0] [L57] EXPR double_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L57] COND FALSE !((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) [L60] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L60] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L65] EXPR unsigned_char_Array_0[1] [L65] signed_short_int_Array_0[2] = unsigned_char_Array_0[1] [L68] EXPR double_Array_0[1] [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] COND FALSE !(double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) [L105] EXPR double_Array_0[1] [L105] EXPR double_Array_0[0] [L105] EXPR double_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))) [L105] EXPR signed_short_int_Array_0[2] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR ((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105-L106] return ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : 1) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 704 mSDsluCounter, 6199 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4635 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 573 IncrementalHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1564 mSDtfsCounter, 573 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=622occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 428 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1100 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 1914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:14:14,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:14:16,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:14:17,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:14:17,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:14:17,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:14:17,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:14:17,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:14:17,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:14:17,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:14:17,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:14:17,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:14:17,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:14:17,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:14:17,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:14:17,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:14:17,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:14:17,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:14:17,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:14:17,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:14:17,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:14:17,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:14:17,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:14:17,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:14:17,089 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:14:17,089 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:14:17,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:14:17,090 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:14:17,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:14:17,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:14:17,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:14:17,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:14:17,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:14:17,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:14:17,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:14:17,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:17,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:14:17,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:14:17,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:14:17,095 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:14:17,095 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:14:17,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:14:17,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:14:17,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:14:17,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:14:17,096 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:14:17,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea [2024-10-11 13:14:17,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:14:17,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:14:17,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:14:17,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:14:17,478 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:14:17,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2024-10-11 13:14:19,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:14:19,311 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:14:19,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2024-10-11 13:14:19,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/42ee9ae98/068331851e204be49bb75bc95a66093c/FLAG7af6369a6 [2024-10-11 13:14:19,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/42ee9ae98/068331851e204be49bb75bc95a66093c [2024-10-11 13:14:19,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:14:19,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:14:19,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:19,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:14:19,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:14:19,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:19,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9b6b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19, skipping insertion in model container [2024-10-11 13:14:19,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:19,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:14:19,586 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i[916,929] [2024-10-11 13:14:19,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:19,716 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:14:19,727 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i[916,929] [2024-10-11 13:14:19,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:19,809 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:14:19,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19 WrapperNode [2024-10-11 13:14:19,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:19,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:19,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:14:19,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:14:19,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:19,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:19,897 INFO L138 Inliner]: procedures = 39, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 624 [2024-10-11 13:14:19,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:19,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:14:19,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:14:19,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:14:19,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:19,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:19,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:19,975 INFO L175 MemorySlicer]: Split 156 memory accesses to 7 slices as follows [2, 14, 89, 3, 21, 22, 5]. 57 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 7, 1, 3, 2, 1]. The 19 writes are split as follows [0, 2, 7, 1, 5, 3, 1]. [2024-10-11 13:14:19,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:19,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:20,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:20,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:20,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:20,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:20,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:14:20,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:14:20,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:14:20,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:14:20,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (1/1) ... [2024-10-11 13:14:20,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:20,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:20,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:14:20,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:14:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:14:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:14:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:14:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:14:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:14:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-11 13:14:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:14:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:14:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:14:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:14:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:14:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:14:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:14:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:14:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:14:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:14:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:14:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:14:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:14:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:14:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:14:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:14:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:14:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:14:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:14:20,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:14:20,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-11 13:14:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-11 13:14:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:14:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:14:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:14:20,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:14:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:14:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:14:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 13:14:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:14:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:14:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:14:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:14:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:14:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:14:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:14:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:14:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:14:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:14:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:14:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:14:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:14:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:14:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:14:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:14:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:14:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:14:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:14:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:14:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:14:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:14:20,154 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:14:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:14:20,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:14:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:14:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:14:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:14:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:14:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:14:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:14:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:14:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:14:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:14:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:14:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:14:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:14:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:14:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:14:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:14:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:14:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:14:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:14:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:14:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:14:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 13:14:20,444 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:14:20,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:14:23,142 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-10-11 13:14:23,142 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:14:23,205 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:14:23,206 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:14:23,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:23 BoogieIcfgContainer [2024-10-11 13:14:23,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:14:23,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:14:23,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:14:23,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:14:23,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:14:19" (1/3) ... [2024-10-11 13:14:23,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282a854c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:23, skipping insertion in model container [2024-10-11 13:14:23,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:19" (2/3) ... [2024-10-11 13:14:23,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282a854c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:23, skipping insertion in model container [2024-10-11 13:14:23,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:23" (3/3) ... [2024-10-11 13:14:23,218 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-17.i [2024-10-11 13:14:23,236 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:14:23,237 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:14:23,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:14:23,319 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;@22d24d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:14:23,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:14:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:14:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:14:23,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:23,340 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:23,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:23,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:23,346 INFO L85 PathProgramCache]: Analyzing trace with hash 317667774, now seen corresponding path program 1 times [2024-10-11 13:14:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139653065] [2024-10-11 13:14:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:23,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:23,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:23,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:23,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:14:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:14:23,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-11 13:14:23,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:23,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139653065] [2024-10-11 13:14:23,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139653065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:23,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:23,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:14:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65591] [2024-10-11 13:14:23,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:23,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:14:23,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:14:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:23,993 INFO L87 Difference]: Start difference. First operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:24,086 INFO L93 Difference]: Finished difference Result 271 states and 428 transitions. [2024-10-11 13:14:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:14:24,089 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-11 13:14:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:24,103 INFO L225 Difference]: With dead ends: 271 [2024-10-11 13:14:24,103 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 13:14:24,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:24,112 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:24,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:14:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 13:14:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-11 13:14:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.452991452991453) internal successors, (170), 117 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:14:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-11 13:14:24,167 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 136 [2024-10-11 13:14:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:24,168 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-11 13:14:24,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-11 13:14:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:14:24,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:24,172 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:24,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:14:24,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:24,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:24,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1627642390, now seen corresponding path program 1 times [2024-10-11 13:14:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:24,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683530072] [2024-10-11 13:14:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:24,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:24,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:24,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:24,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:14:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:14:24,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-10-11 13:14:25,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:25,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683530072] [2024-10-11 13:14:25,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683530072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:25,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:25,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686200098] [2024-10-11 13:14:25,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:25,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:25,006 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:25,103 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2024-10-11 13:14:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:25,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-11 13:14:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:25,105 INFO L225 Difference]: With dead ends: 271 [2024-10-11 13:14:25,105 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 13:14:25,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:25,107 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:25,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:14:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 13:14:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-11 13:14:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:14:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2024-10-11 13:14:25,127 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 136 [2024-10-11 13:14:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:25,132 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2024-10-11 13:14:25,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2024-10-11 13:14:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:14:25,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:25,137 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:25,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:25,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:25,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:25,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1599142100, now seen corresponding path program 1 times [2024-10-11 13:14:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:25,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144349932] [2024-10-11 13:14:25,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:25,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:25,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:25,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:25,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:14:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:25,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:14:25,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:25,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:25,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:25,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144349932] [2024-10-11 13:14:25,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144349932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:25,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:25,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560647897] [2024-10-11 13:14:25,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:25,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:25,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:25,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:25,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:25,872 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:26,118 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2024-10-11 13:14:26,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:26,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-10-11 13:14:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:26,124 INFO L225 Difference]: With dead ends: 275 [2024-10-11 13:14:26,124 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 13:14:26,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:26,129 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:26,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 13:14:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-11 13:14:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:14:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2024-10-11 13:14:26,145 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 136 [2024-10-11 13:14:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:26,147 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2024-10-11 13:14:26,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2024-10-11 13:14:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 13:14:26,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:26,151 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:26,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:14:26,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:26,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:26,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash 142937969, now seen corresponding path program 1 times [2024-10-11 13:14:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:26,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762586123] [2024-10-11 13:14:26,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:26,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:26,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:26,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:26,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:14:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:14:26,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:27,033 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-10-11 13:14:27,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:14:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:27,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:27,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762586123] [2024-10-11 13:14:27,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762586123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:27,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:27,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320891343] [2024-10-11 13:14:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:14:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:27,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:14:27,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:27,517 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:28,455 INFO L93 Difference]: Finished difference Result 556 states and 824 transitions. [2024-10-11 13:14:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:14:28,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-11 13:14:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:28,459 INFO L225 Difference]: With dead ends: 556 [2024-10-11 13:14:28,459 INFO L226 Difference]: Without dead ends: 418 [2024-10-11 13:14:28,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:14:28,461 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 614 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:28,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1266 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:14:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-11 13:14:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 318. [2024-10-11 13:14:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 283 states have (on average 1.4452296819787986) internal successors, (409), 283 states have internal predecessors, (409), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:14:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 473 transitions. [2024-10-11 13:14:28,505 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 473 transitions. Word has length 138 [2024-10-11 13:14:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:28,508 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 473 transitions. [2024-10-11 13:14:28,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 473 transitions. [2024-10-11 13:14:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 13:14:28,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:28,510 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:28,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:28,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:28,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:28,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash -666408657, now seen corresponding path program 1 times [2024-10-11 13:14:28,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:28,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773919682] [2024-10-11 13:14:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:28,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:28,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:28,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:28,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:14:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:29,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:14:29,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:29,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:29,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-10-11 13:14:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-11 13:14:29,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:29,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:29,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773919682] [2024-10-11 13:14:29,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773919682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:29,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:29,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:14:29,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951606341] [2024-10-11 13:14:29,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:29,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:29,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:29,426 INFO L87 Difference]: Start difference. First operand 318 states and 473 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:32,739 INFO L93 Difference]: Finished difference Result 637 states and 947 transitions. [2024-10-11 13:14:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:32,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2024-10-11 13:14:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:32,744 INFO L225 Difference]: With dead ends: 637 [2024-10-11 13:14:32,744 INFO L226 Difference]: Without dead ends: 320 [2024-10-11 13:14:32,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:14:32,746 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 185 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:32,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 501 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 13:14:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-11 13:14:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2024-10-11 13:14:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 283 states have (on average 1.4381625441696113) internal successors, (407), 283 states have internal predecessors, (407), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:14:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 471 transitions. [2024-10-11 13:14:32,777 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 471 transitions. Word has length 138 [2024-10-11 13:14:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:32,778 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 471 transitions. [2024-10-11 13:14:32,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 471 transitions. [2024-10-11 13:14:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:14:32,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:32,780 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:32,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 13:14:32,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:32,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:32,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1832342507, now seen corresponding path program 1 times [2024-10-11 13:14:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:32,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539651531] [2024-10-11 13:14:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:32,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:32,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:32,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:32,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 13:14:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:33,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:14:33,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-11 13:14:33,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:33,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:33,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539651531] [2024-10-11 13:14:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539651531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238215185] [2024-10-11 13:14:33,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:33,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:33,537 INFO L87 Difference]: Start difference. First operand 318 states and 471 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 13:14:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:33,804 INFO L93 Difference]: Finished difference Result 643 states and 951 transitions. [2024-10-11 13:14:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:33,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 140 [2024-10-11 13:14:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:33,807 INFO L225 Difference]: With dead ends: 643 [2024-10-11 13:14:33,808 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 13:14:33,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:33,811 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:33,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 850 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 13:14:33,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2024-10-11 13:14:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 283 states have (on average 1.431095406360424) internal successors, (405), 283 states have internal predecessors, (405), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:14:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2024-10-11 13:14:33,838 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 140 [2024-10-11 13:14:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:33,839 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2024-10-11 13:14:33,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 13:14:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2024-10-11 13:14:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 13:14:33,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:33,842 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:33,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 13:14:34,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:34,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:34,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash -815261847, now seen corresponding path program 1 times [2024-10-11 13:14:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:34,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810345578] [2024-10-11 13:14:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:34,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:34,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:34,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:34,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 13:14:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:34,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:14:34,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:34,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:34,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-11 13:14:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-11 13:14:34,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:34,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:34,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810345578] [2024-10-11 13:14:34,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810345578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:34,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:34,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:14:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013080502] [2024-10-11 13:14:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:34,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:34,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:34,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:34,738 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:38,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:14:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:40,350 INFO L93 Difference]: Finished difference Result 637 states and 939 transitions. [2024-10-11 13:14:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:40,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2024-10-11 13:14:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:40,354 INFO L225 Difference]: With dead ends: 637 [2024-10-11 13:14:40,354 INFO L226 Difference]: Without dead ends: 320 [2024-10-11 13:14:40,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:14:40,356 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 174 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:40,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 493 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 13:14:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-11 13:14:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2024-10-11 13:14:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 283 states have (on average 1.4240282685512367) internal successors, (403), 283 states have internal predecessors, (403), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:14:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2024-10-11 13:14:40,377 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 140 [2024-10-11 13:14:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:40,377 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2024-10-11 13:14:40,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2024-10-11 13:14:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 13:14:40,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:40,380 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:40,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 13:14:40,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:40,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:40,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:40,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1835655023, now seen corresponding path program 1 times [2024-10-11 13:14:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:40,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766723474] [2024-10-11 13:14:40,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:40,584 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:40,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 13:14:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:41,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:14:41,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:41,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:41,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-11 13:14:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-10-11 13:14:41,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:41,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:41,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766723474] [2024-10-11 13:14:41,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766723474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:41,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:41,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:14:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326197681] [2024-10-11 13:14:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:41,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:41,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:41,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:41,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:41,300 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:44,500 INFO L93 Difference]: Finished difference Result 635 states and 933 transitions. [2024-10-11 13:14:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:44,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2024-10-11 13:14:44,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:44,504 INFO L225 Difference]: With dead ends: 635 [2024-10-11 13:14:44,504 INFO L226 Difference]: Without dead ends: 318 [2024-10-11 13:14:44,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:14:44,506 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 166 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:44,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 489 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 13:14:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-11 13:14:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2024-10-11 13:14:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 279 states have (on average 1.4229390681003584) internal successors, (397), 279 states have internal predecessors, (397), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:14:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 461 transitions. [2024-10-11 13:14:44,524 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 461 transitions. Word has length 142 [2024-10-11 13:14:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:44,524 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 461 transitions. [2024-10-11 13:14:44,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:14:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 461 transitions. [2024-10-11 13:14:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:14:44,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:44,526 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:44,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 13:14:44,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:44,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:44,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1215404903, now seen corresponding path program 1 times [2024-10-11 13:14:44,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54857670] [2024-10-11 13:14:44,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:44,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:44,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:44,730 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:44,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 13:14:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:45,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:14:45,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:45,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:45,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2024-10-11 13:14:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 252 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-11 13:14:45,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:45,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:45,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2024-10-11 13:14:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 13:14:45,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:45,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54857670] [2024-10-11 13:14:45,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54857670] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:14:45,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:14:45,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-11 13:14:45,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881517583] [2024-10-11 13:14:45,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:14:45,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:14:45,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:45,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:14:45,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:14:45,765 INFO L87 Difference]: Start difference. First operand 314 states and 461 transitions. Second operand has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2024-10-11 13:14:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:49,925 INFO L93 Difference]: Finished difference Result 653 states and 951 transitions. [2024-10-11 13:14:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:14:49,927 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) Word has length 144 [2024-10-11 13:14:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:49,929 INFO L225 Difference]: With dead ends: 653 [2024-10-11 13:14:49,929 INFO L226 Difference]: Without dead ends: 318 [2024-10-11 13:14:49,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:14:49,931 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 168 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:49,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 741 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 13:14:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-11 13:14:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2024-10-11 13:14:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 279 states have (on average 1.4086021505376345) internal successors, (393), 279 states have internal predecessors, (393), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:14:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 457 transitions. [2024-10-11 13:14:49,944 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 457 transitions. Word has length 144 [2024-10-11 13:14:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:49,944 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 457 transitions. [2024-10-11 13:14:49,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2024-10-11 13:14:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 457 transitions. [2024-10-11 13:14:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:14:49,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:49,946 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:49,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 13:14:50,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:50,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:50,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2022831191, now seen corresponding path program 1 times [2024-10-11 13:14:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914395335] [2024-10-11 13:14:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:50,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:50,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:50,149 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:50,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 13:14:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:50,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:14:50,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:50,733 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 35 treesize of output 31 [2024-10-11 13:14:50,787 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 108 treesize of output 90 [2024-10-11 13:14:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:50,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:14:50,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:50,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914395335] [2024-10-11 13:14:50,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914395335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:50,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:50,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:50,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153880384] [2024-10-11 13:14:50,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:50,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:50,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:50,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:50,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:50,824 INFO L87 Difference]: Start difference. First operand 314 states and 457 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:51,525 INFO L93 Difference]: Finished difference Result 949 states and 1381 transitions. [2024-10-11 13:14:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:14:51,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 144 [2024-10-11 13:14:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:51,529 INFO L225 Difference]: With dead ends: 949 [2024-10-11 13:14:51,529 INFO L226 Difference]: Without dead ends: 636 [2024-10-11 13:14:51,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 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-10-11 13:14:51,530 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 184 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:51,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1280 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:14:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-11 13:14:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2024-10-11 13:14:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 565 states have (on average 1.4035398230088496) internal successors, (793), 565 states have internal predecessors, (793), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 13:14:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 921 transitions. [2024-10-11 13:14:51,560 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 921 transitions. Word has length 144 [2024-10-11 13:14:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:51,561 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 921 transitions. [2024-10-11 13:14:51,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 921 transitions. [2024-10-11 13:14:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 13:14:51,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:51,563 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:51,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:51,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:51,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:51,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1474620713, now seen corresponding path program 1 times [2024-10-11 13:14:51,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:51,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499511581] [2024-10-11 13:14:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:51,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:51,767 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:51,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 13:14:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:14:52,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-10-11 13:14:52,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:14:52,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:14:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499511581] [2024-10-11 13:14:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499511581] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:52,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:14:52,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-11 13:14:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590014520] [2024-10-11 13:14:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:52,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:14:52,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:14:52,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:14:52,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:14:52,909 INFO L87 Difference]: Start difference. First operand 634 states and 921 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:53,816 INFO L93 Difference]: Finished difference Result 1612 states and 2337 transitions. [2024-10-11 13:14:53,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:14:53,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 144 [2024-10-11 13:14:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:53,821 INFO L225 Difference]: With dead ends: 1612 [2024-10-11 13:14:53,821 INFO L226 Difference]: Without dead ends: 979 [2024-10-11 13:14:53,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:14:53,823 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 90 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:53,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 725 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:14:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-11 13:14:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 973. [2024-10-11 13:14:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 892 states have (on average 1.4147982062780269) internal successors, (1262), 896 states have internal predecessors, (1262), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 13:14:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1406 transitions. [2024-10-11 13:14:53,861 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1406 transitions. Word has length 144 [2024-10-11 13:14:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:53,862 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1406 transitions. [2024-10-11 13:14:53,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:14:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1406 transitions. [2024-10-11 13:14:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 13:14:53,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:53,865 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:53,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 13:14:54,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:54,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:54,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1128514677, now seen corresponding path program 1 times [2024-10-11 13:14:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:14:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285465660] [2024-10-11 13:14:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:54,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:14:54,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:14:54,069 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:14:54,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process