./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:10:36,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:10:36,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:10:36,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:10:36,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:10:36,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:10:36,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:10:36,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:10:36,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:10:36,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:10:36,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:10:36,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:10:36,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:10:36,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:10:36,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:10:36,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:10:36,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:10:36,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:10:36,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:10:36,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:10:36,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:10:36,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:10:36,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:10:36,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:10:36,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:10:36,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:10:36,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:10:36,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:10:36,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:10:36,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:10:36,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:10:36,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:10:36,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:10:36,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:10:36,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:10:36,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:10:36,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:10:36,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:10:36,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:10:36,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:10:36,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:10:36,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:10:36,891 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b [2024-11-16 18:10:37,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:10:37,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:10:37,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:10:37,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:10:37,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:10:37,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i [2024-11-16 18:10:38,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:10:38,842 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:10:38,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i [2024-11-16 18:10:38,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc35d6ca/87f32a8740684da680b51b1d87b779ff/FLAG46c8f42a0 [2024-11-16 18:10:38,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc35d6ca/87f32a8740684da680b51b1d87b779ff [2024-11-16 18:10:38,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:10:38,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:10:38,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:10:38,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:10:38,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:10:38,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:10:38" (1/1) ... [2024-11-16 18:10:38,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f827826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:38, skipping insertion in model container [2024-11-16 18:10:38,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:10:38" (1/1) ... [2024-11-16 18:10:38,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:10:39,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i[916,929] [2024-11-16 18:10:39,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:10:39,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:10:39,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i[916,929] [2024-11-16 18:10:39,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:10:39,346 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:10:39,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39 WrapperNode [2024-11-16 18:10:39,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:10:39,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:10:39,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:10:39,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:10:39,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,470 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 557 [2024-11-16 18:10:39,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:10:39,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:10:39,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:10:39,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:10:39,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,522 INFO L175 MemorySlicer]: Split 146 memory accesses to 5 slices as follows [2, 33, 56, 35, 20]. 38 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 4, 4, 2]. The 19 writes are split as follows [0, 6, 6, 5, 2]. [2024-11-16 18:10:39,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:10:39,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:10:39,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:10:39,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:10:39,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (1/1) ... [2024-11-16 18:10:39,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:10:39,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:10:39,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:10:39,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:10:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:10:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:10:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:10:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 18:10:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 18:10:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 18:10:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 18:10:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 18:10:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-16 18:10:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-16 18:10:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-16 18:10:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 18:10:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 18:10:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-16 18:10:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-16 18:10:39,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-16 18:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 18:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 18:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 18:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 18:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 18:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-16 18:10:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-16 18:10:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-16 18:10:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:10:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:10:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:10:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:10:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 18:10:39,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 18:10:39,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 18:10:39,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:10:39,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:10:39,803 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:10:39,805 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:10:40,266 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem91#1;havoc property_#t~ite107#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem103#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite120#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem131#1;havoc property_#t~mem122#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~ite130#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite139#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite155#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1; [2024-11-16 18:10:40,337 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-11-16 18:10:40,338 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:10:40,362 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:10:40,363 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:10:40,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:10:40 BoogieIcfgContainer [2024-11-16 18:10:40,364 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:10:40,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:10:40,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:10:40,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:10:40,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:10:38" (1/3) ... [2024-11-16 18:10:40,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b58f8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:10:40, skipping insertion in model container [2024-11-16 18:10:40,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:10:39" (2/3) ... [2024-11-16 18:10:40,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b58f8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:10:40, skipping insertion in model container [2024-11-16 18:10:40,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:10:40" (3/3) ... [2024-11-16 18:10:40,376 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-25.i [2024-11-16 18:10:40,393 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:10:40,393 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:10:40,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:10:40,470 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;@35c27a7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:10:40,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:10:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 107 states have internal predecessors, (150), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:10:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:10:40,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:40,496 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:40,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:40,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:40,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1233751539, now seen corresponding path program 1 times [2024-11-16 18:10:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965839512] [2024-11-16 18:10:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965839512] [2024-11-16 18:10:40,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965839512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:40,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:40,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:10:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75122599] [2024-11-16 18:10:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:40,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:10:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:10:40,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:10:40,987 INFO L87 Difference]: Start difference. First operand has 127 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 107 states have internal predecessors, (150), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:10:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:41,020 INFO L93 Difference]: Finished difference Result 246 states and 383 transitions. [2024-11-16 18:10:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:10:41,023 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-11-16 18:10:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:41,030 INFO L225 Difference]: With dead ends: 246 [2024-11-16 18:10:41,030 INFO L226 Difference]: Without dead ends: 122 [2024-11-16 18:10:41,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:10:41,038 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:41,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:10:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-16 18:10:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-16 18:10:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:10:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-16 18:10:41,139 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 146 [2024-11-16 18:10:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:41,140 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-16 18:10:41,141 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:10:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-16 18:10:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:10:41,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:41,148 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:41,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:10:41,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:41,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:41,150 INFO L85 PathProgramCache]: Analyzing trace with hash -530871741, now seen corresponding path program 1 times [2024-11-16 18:10:41,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:41,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839060176] [2024-11-16 18:10:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:41,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:42,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:42,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:42,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:43,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:43,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839060176] [2024-11-16 18:10:43,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839060176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:43,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:43,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:10:43,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848047834] [2024-11-16 18:10:43,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:43,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:10:43,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:43,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:10:43,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:10:43,063 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:10:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:43,515 INFO L93 Difference]: Finished difference Result 362 states and 526 transitions. [2024-11-16 18:10:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:10:43,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-11-16 18:10:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:43,519 INFO L225 Difference]: With dead ends: 362 [2024-11-16 18:10:43,519 INFO L226 Difference]: Without dead ends: 243 [2024-11-16 18:10:43,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:10:43,521 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 224 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:43,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1359 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:10:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-16 18:10:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 206. [2024-11-16 18:10:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 178 states have internal predecessors, (248), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 18:10:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 300 transitions. [2024-11-16 18:10:43,558 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 300 transitions. Word has length 146 [2024-11-16 18:10:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:43,559 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 300 transitions. [2024-11-16 18:10:43,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:10:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 300 transitions. [2024-11-16 18:10:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:10:43,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:43,563 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:43,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:10:43,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:43,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash 452197765, now seen corresponding path program 1 times [2024-11-16 18:10:43,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:43,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069336247] [2024-11-16 18:10:43,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:43,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069336247] [2024-11-16 18:10:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069336247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:43,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:43,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:10:43,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064377695] [2024-11-16 18:10:43,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:43,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:10:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:43,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:10:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:10:43,921 INFO L87 Difference]: Start difference. First operand 206 states and 300 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:10:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:44,119 INFO L93 Difference]: Finished difference Result 475 states and 688 transitions. [2024-11-16 18:10:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:10:44,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:10:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:44,123 INFO L225 Difference]: With dead ends: 475 [2024-11-16 18:10:44,124 INFO L226 Difference]: Without dead ends: 272 [2024-11-16 18:10:44,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:10:44,126 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 157 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:44,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 783 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:10:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-16 18:10:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2024-11-16 18:10:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.3568075117370892) internal successors, (289), 215 states have internal predecessors, (289), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 18:10:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 377 transitions. [2024-11-16 18:10:44,171 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 377 transitions. Word has length 147 [2024-11-16 18:10:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:44,171 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 377 transitions. [2024-11-16 18:10:44,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:10:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 377 transitions. [2024-11-16 18:10:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 18:10:44,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:44,177 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:44,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:10:44,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:44,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash 688871721, now seen corresponding path program 1 times [2024-11-16 18:10:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:44,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168272373] [2024-11-16 18:10:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:44,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:44,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168272373] [2024-11-16 18:10:44,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168272373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:44,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:44,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:10:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323025745] [2024-11-16 18:10:44,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:44,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:10:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:10:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:10:44,397 INFO L87 Difference]: Start difference. First operand 262 states and 377 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:10:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:44,474 INFO L93 Difference]: Finished difference Result 495 states and 714 transitions. [2024-11-16 18:10:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:10:44,475 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-16 18:10:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:44,477 INFO L225 Difference]: With dead ends: 495 [2024-11-16 18:10:44,477 INFO L226 Difference]: Without dead ends: 268 [2024-11-16 18:10:44,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:10:44,479 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:44,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:10:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-16 18:10:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2024-11-16 18:10:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 217 states have (on average 1.3502304147465438) internal successors, (293), 219 states have internal predecessors, (293), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 18:10:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 381 transitions. [2024-11-16 18:10:44,512 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 381 transitions. Word has length 148 [2024-11-16 18:10:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:44,513 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 381 transitions. [2024-11-16 18:10:44,513 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:10:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 381 transitions. [2024-11-16 18:10:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:10:44,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:44,515 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:44,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:10:44,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:44,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1514348761, now seen corresponding path program 1 times [2024-11-16 18:10:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:44,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908752970] [2024-11-16 18:10:44,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:44,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:44,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:44,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908752970] [2024-11-16 18:10:44,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908752970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:44,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:44,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:10:44,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091892877] [2024-11-16 18:10:44,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:44,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:10:44,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:44,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:10:44,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:10:44,849 INFO L87 Difference]: Start difference. First operand 266 states and 381 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:10:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:45,085 INFO L93 Difference]: Finished difference Result 500 states and 717 transitions. [2024-11-16 18:10:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:10:45,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-16 18:10:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:45,089 INFO L225 Difference]: With dead ends: 500 [2024-11-16 18:10:45,091 INFO L226 Difference]: Without dead ends: 269 [2024-11-16 18:10:45,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:10:45,093 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 140 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:45,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 820 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:10:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-16 18:10:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2024-11-16 18:10:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 210 states have (on average 1.3428571428571427) internal successors, (282), 212 states have internal predecessors, (282), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 18:10:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 370 transitions. [2024-11-16 18:10:45,126 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 370 transitions. Word has length 150 [2024-11-16 18:10:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:45,127 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 370 transitions. [2024-11-16 18:10:45,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:10:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 370 transitions. [2024-11-16 18:10:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:10:45,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:45,130 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:45,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:10:45,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:45,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:45,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1364697767, now seen corresponding path program 1 times [2024-11-16 18:10:45,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:45,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683051261] [2024-11-16 18:10:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:45,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 18:10:45,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683051261] [2024-11-16 18:10:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683051261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:10:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088789683] [2024-11-16 18:10:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:45,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:10:45,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:10:45,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:10:45,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:10:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:46,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 18:10:46,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:10:46,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-16 18:10:46,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-16 18:10:46,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:10:46,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-16 18:10:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-16 18:10:46,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:10:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 18:10:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088789683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:10:47,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 18:10:47,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-16 18:10:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3541214] [2024-11-16 18:10:47,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 18:10:47,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:10:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:47,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:10:47,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:10:47,081 INFO L87 Difference]: Start difference. First operand 259 states and 370 transitions. Second operand has 13 states, 11 states have (on average 9.0) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-16 18:10:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:47,795 INFO L93 Difference]: Finished difference Result 643 states and 901 transitions. [2024-11-16 18:10:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-16 18:10:47,796 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) Word has length 150 [2024-11-16 18:10:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:47,799 INFO L225 Difference]: With dead ends: 643 [2024-11-16 18:10:47,800 INFO L226 Difference]: Without dead ends: 419 [2024-11-16 18:10:47,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 327 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2024-11-16 18:10:47,801 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 428 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:47,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 902 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:10:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-16 18:10:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 395. [2024-11-16 18:10:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 321 states have (on average 1.3302180685358256) internal successors, (427), 324 states have internal predecessors, (427), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 18:10:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 551 transitions. [2024-11-16 18:10:47,850 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 551 transitions. Word has length 150 [2024-11-16 18:10:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:47,852 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 551 transitions. [2024-11-16 18:10:47,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-16 18:10:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 551 transitions. [2024-11-16 18:10:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 18:10:47,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:47,855 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:47,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 18:10:48,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 18:10:48,057 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:48,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash 746971497, now seen corresponding path program 1 times [2024-11-16 18:10:48,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:48,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442383191] [2024-11-16 18:10:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:48,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442383191] [2024-11-16 18:10:48,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442383191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:48,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:48,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:10:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690356832] [2024-11-16 18:10:48,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:48,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:10:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:48,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:10:48,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:10:48,421 INFO L87 Difference]: Start difference. First operand 395 states and 551 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:10:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:48,603 INFO L93 Difference]: Finished difference Result 952 states and 1335 transitions. [2024-11-16 18:10:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:10:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-11-16 18:10:48,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:48,608 INFO L225 Difference]: With dead ends: 952 [2024-11-16 18:10:48,608 INFO L226 Difference]: Without dead ends: 600 [2024-11-16 18:10:48,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:10:48,609 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 147 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:48,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1012 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:10:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-16 18:10:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 595. [2024-11-16 18:10:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 488 states have (on average 1.3360655737704918) internal successors, (652), 493 states have internal predecessors, (652), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-16 18:10:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 832 transitions. [2024-11-16 18:10:48,677 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 832 transitions. Word has length 151 [2024-11-16 18:10:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:48,678 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 832 transitions. [2024-11-16 18:10:48,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:10:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 832 transitions. [2024-11-16 18:10:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:10:48,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:48,680 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:48,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:10:48,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:48,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:48,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1333244057, now seen corresponding path program 1 times [2024-11-16 18:10:48,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:48,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421040867] [2024-11-16 18:10:48,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:48,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421040867] [2024-11-16 18:10:51,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421040867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:51,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:51,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 18:10:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830784772] [2024-11-16 18:10:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:51,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 18:10:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 18:10:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:10:51,057 INFO L87 Difference]: Start difference. First operand 595 states and 832 transitions. Second operand has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-16 18:10:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:51,869 INFO L93 Difference]: Finished difference Result 1348 states and 1887 transitions. [2024-11-16 18:10:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 18:10:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2024-11-16 18:10:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:51,875 INFO L225 Difference]: With dead ends: 1348 [2024-11-16 18:10:51,876 INFO L226 Difference]: Without dead ends: 796 [2024-11-16 18:10:51,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:10:51,879 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 139 mSDsluCounter, 2537 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:51,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2792 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:10:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-16 18:10:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 745. [2024-11-16 18:10:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 628 states have (on average 1.3535031847133758) internal successors, (850), 634 states have internal predecessors, (850), 98 states have call successors, (98), 18 states have call predecessors, (98), 18 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-16 18:10:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1046 transitions. [2024-11-16 18:10:51,975 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1046 transitions. Word has length 153 [2024-11-16 18:10:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:51,975 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 1046 transitions. [2024-11-16 18:10:51,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-16 18:10:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1046 transitions. [2024-11-16 18:10:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:10:51,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:51,978 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:51,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:10:51,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:51,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:51,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1838802682, now seen corresponding path program 1 times [2024-11-16 18:10:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844221478] [2024-11-16 18:10:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:52,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844221478] [2024-11-16 18:10:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844221478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:52,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:52,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:10:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262816944] [2024-11-16 18:10:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:52,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:10:52,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:52,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:10:52,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:10:52,822 INFO L87 Difference]: Start difference. First operand 745 states and 1046 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:10:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:53,281 INFO L93 Difference]: Finished difference Result 1548 states and 2164 transitions. [2024-11-16 18:10:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:10:53,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-16 18:10:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:53,287 INFO L225 Difference]: With dead ends: 1548 [2024-11-16 18:10:53,287 INFO L226 Difference]: Without dead ends: 806 [2024-11-16 18:10:53,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:10:53,289 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 141 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:53,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1833 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:10:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-16 18:10:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 801. [2024-11-16 18:10:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 663 states have (on average 1.3378582202111613) internal successors, (887), 670 states have internal predecessors, (887), 114 states have call successors, (114), 23 states have call predecessors, (114), 23 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-16 18:10:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1115 transitions. [2024-11-16 18:10:53,388 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1115 transitions. Word has length 153 [2024-11-16 18:10:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:53,389 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1115 transitions. [2024-11-16 18:10:53,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:10:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1115 transitions. [2024-11-16 18:10:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:10:53,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:53,391 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:53,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:10:53,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:53,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1587980602, now seen corresponding path program 1 times [2024-11-16 18:10:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435004849] [2024-11-16 18:10:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:54,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:54,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435004849] [2024-11-16 18:10:54,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435004849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:54,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:54,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:10:54,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389993536] [2024-11-16 18:10:54,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:54,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:10:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:54,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:10:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:10:54,358 INFO L87 Difference]: Start difference. First operand 801 states and 1115 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:10:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:54,835 INFO L93 Difference]: Finished difference Result 1572 states and 2186 transitions. [2024-11-16 18:10:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:10:54,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-16 18:10:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:54,840 INFO L225 Difference]: With dead ends: 1572 [2024-11-16 18:10:54,840 INFO L226 Difference]: Without dead ends: 814 [2024-11-16 18:10:54,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:10:54,843 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 144 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:54,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1117 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:10:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-16 18:10:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 781. [2024-11-16 18:10:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 653 states have (on average 1.339969372128637) internal successors, (875), 660 states have internal predecessors, (875), 104 states have call successors, (104), 23 states have call predecessors, (104), 23 states have return successors, (104), 97 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-16 18:10:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1083 transitions. [2024-11-16 18:10:54,950 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1083 transitions. Word has length 153 [2024-11-16 18:10:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:54,950 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1083 transitions. [2024-11-16 18:10:54,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:10:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1083 transitions. [2024-11-16 18:10:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:10:54,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:54,953 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:54,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:10:54,953 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:54,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:54,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2093539227, now seen corresponding path program 1 times [2024-11-16 18:10:54,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:54,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814471309] [2024-11-16 18:10:54,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:54,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:10:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:10:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:10:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:10:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:10:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:10:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:10:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:10:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:10:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:10:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:10:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:10:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:10:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:10:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:10:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:10:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:10:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 18:10:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:10:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:10:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:10:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814471309] [2024-11-16 18:10:56,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814471309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:10:56,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:10:56,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 18:10:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212813663] [2024-11-16 18:10:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:10:56,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 18:10:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:10:56,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 18:10:56,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:10:56,539 INFO L87 Difference]: Start difference. First operand 781 states and 1083 transitions. Second operand has 14 states, 11 states have (on average 6.0) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-16 18:10:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:10:57,406 INFO L93 Difference]: Finished difference Result 1537 states and 2127 transitions. [2024-11-16 18:10:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 18:10:57,407 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.0) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 153 [2024-11-16 18:10:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:10:57,412 INFO L225 Difference]: With dead ends: 1537 [2024-11-16 18:10:57,412 INFO L226 Difference]: Without dead ends: 799 [2024-11-16 18:10:57,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:10:57,417 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 112 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:10:57,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 3133 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:10:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-16 18:10:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 575. [2024-11-16 18:10:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 487 states have (on average 1.353182751540041) internal successors, (659), 491 states have internal predecessors, (659), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 18:10:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 803 transitions. [2024-11-16 18:10:57,498 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 803 transitions. Word has length 153 [2024-11-16 18:10:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:10:57,499 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 803 transitions. [2024-11-16 18:10:57,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.0) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-16 18:10:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 803 transitions. [2024-11-16 18:10:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:10:57,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:10:57,501 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:57,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:10:57,501 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:10:57,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:10:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1689192527, now seen corresponding path program 1 times [2024-11-16 18:10:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:10:57,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226480586] [2024-11-16 18:10:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:10:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:10:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:10:57,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:10:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:10:57,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:10:57,682 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:10:57,683 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:10:57,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:10:57,687 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:10:57,791 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:10:57,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:10:57 BoogieIcfgContainer [2024-11-16 18:10:57,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:10:57,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:10:57,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:10:57,794 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:10:57,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:10:40" (3/4) ... [2024-11-16 18:10:57,797 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:10:57,798 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:10:57,798 INFO L158 Benchmark]: Toolchain (without parser) took 18915.71ms. Allocated memory was 163.6MB in the beginning and 627.0MB in the end (delta: 463.5MB). Free memory was 89.4MB in the beginning and 369.7MB in the end (delta: -280.3MB). Peak memory consumption was 184.3MB. Max. memory is 16.1GB. [2024-11-16 18:10:57,799 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 163.6MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:10:57,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.28ms. Allocated memory is still 163.6MB. Free memory was 89.2MB in the beginning and 71.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 18:10:57,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.71ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 71.4MB in the beginning and 182.2MB in the end (delta: -110.8MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-11-16 18:10:57,799 INFO L158 Benchmark]: Boogie Preprocessor took 92.30ms. Allocated memory is still 211.8MB. Free memory was 182.2MB in the beginning and 177.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:10:57,800 INFO L158 Benchmark]: IcfgBuilder took 799.93ms. Allocated memory is still 211.8MB. Free memory was 177.0MB in the beginning and 139.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-16 18:10:57,801 INFO L158 Benchmark]: TraceAbstraction took 17427.80ms. Allocated memory was 211.8MB in the beginning and 627.0MB in the end (delta: 415.2MB). Free memory was 138.2MB in the beginning and 369.7MB in the end (delta: -231.5MB). Peak memory consumption was 182.7MB. Max. memory is 16.1GB. [2024-11-16 18:10:57,801 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 627.0MB. Free memory is still 369.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:10:57,803 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.67ms. Allocated memory is still 163.6MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.28ms. Allocated memory is still 163.6MB. Free memory was 89.2MB in the beginning and 71.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.71ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 71.4MB in the beginning and 182.2MB in the end (delta: -110.8MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.30ms. Allocated memory is still 211.8MB. Free memory was 182.2MB in the beginning and 177.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 799.93ms. Allocated memory is still 211.8MB. Free memory was 177.0MB in the beginning and 139.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17427.80ms. Allocated memory was 211.8MB in the beginning and 627.0MB in the end (delta: 415.2MB). Free memory was 138.2MB in the beginning and 369.7MB in the end (delta: -231.5MB). Peak memory consumption was 182.7MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 627.0MB. Free memory is still 369.7MB. 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 someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 0} }; [L25-L27] float float_Array_0[2][2] = { {63.363, 128.9}, {4.575, 25.5} }; [L25-L27] float float_Array_0[2][2] = { {63.363, 128.9}, {4.575, 25.5} }; [L25-L27] float float_Array_0[2][2] = { {63.363, 128.9}, {4.575, 25.5} }; [L25-L27] float float_Array_0[2][2] = { {63.363, 128.9}, {4.575, 25.5} }; [L25-L27] float float_Array_0[2][2] = { {63.363, 128.9}, {4.575, 25.5} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2] = { {10, 0}, {1509114200, 256} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2] = { {10, 0}, {1509114200, 256} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2] = { {10, 0}, {1509114200, 256} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2] = { {10, 0}, {1509114200, 256} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2] = { {10, 0}, {1509114200, 256} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 500, 10 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 500, 10 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 500, 10 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] float_Array_0[0][0] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0][0] [L79] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L79] EXPR float_Array_0[0][0] [L79] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] float_Array_0[1][0] = __VERIFIER_nondet_float() [L81] EXPR float_Array_0[1][0] [L81] EXPR float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F [L81] EXPR float_Array_0[1][0] [L81] EXPR float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR (float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854765600e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] EXPR (float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854765600e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854765600e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854765600e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854765600e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L83] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L86] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] unsigned_long_int_Array_0[0][1] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] EXPR unsigned_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L93] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L109] RET updateVariables() [L110] CALL step() [L37] EXPR float_Array_0[0][0] [L37] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] COND FALSE !(float_Array_0[0][0] != float_Array_0[1][0]) [L44] EXPR BOOL_unsigned_char_Array_0[0][1] [L44] BOOL_unsigned_char_Array_0[0][0] = BOOL_unsigned_char_Array_0[0][1] [L46] EXPR unsigned_short_int_Array_0[1] [L46] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[1]; [L47] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L47] COND TRUE BOOL_unsigned_char_Array_0[0][0] [L48] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L48] COND FALSE !(stepLocal_0 <= unsigned_short_int_Array_0[0]) [L54] EXPR unsigned_long_int_Array_0[1][1] [L54] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[1][1]; [L55] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L55] COND TRUE unsigned_long_int_Array_0[0][0] >= stepLocal_1 [L56] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L56] EXPR ((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]) [L56] EXPR ((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L56] float_Array_0[0][1] = ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))) [L60] EXPR float_Array_0[1][0] [L60] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR ((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0]) [L60] EXPR ((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR ((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1]) [L60] EXPR float_Array_0[0][1] [L60] EXPR ((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] COND TRUE float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1]))) [L61] EXPR float_Array_0[1][0] [L61] float_Array_0[1][1] = float_Array_0[1][0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0])) [L101] EXPR unsigned_short_int_Array_0[1] [L101] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1 [L101] EXPR (unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])))))) [L101] EXPR unsigned_long_int_Array_0[0][0] [L101] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR (unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))) [L101] EXPR float_Array_0[0][1] [L101] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR ((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]) [L101] EXPR ((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR (unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR ((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR ((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR (((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1))) && ((float_Array_0[0][0] != float_Array_0[1][0]) ? ((BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101] EXPR (((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1))) && ((float_Array_0[0][0] != float_Array_0[1][0]) ? ((BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L101-L102] return (((BOOL_unsigned_char_Array_0[0][0] ? ((unsigned_short_int_Array_0[1] <= unsigned_short_int_Array_0[0]) ? (unsigned_long_int_Array_0[1][1] == ((unsigned long int) (((((unsigned_short_int_Array_0[1]) > ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1]))) ? (unsigned_short_int_Array_0[1]) : ((unsigned_short_int_Array_0[0] + unsigned_long_int_Array_0[0][1])))) + (unsigned_long_int_Array_0[1][0] - unsigned_long_int_Array_0[0][0])))) : 1) : (unsigned_long_int_Array_0[1][1] == ((unsigned long int) unsigned_long_int_Array_0[0][0]))) && ((unsigned_long_int_Array_0[0][0] >= unsigned_long_int_Array_0[1][1]) ? (float_Array_0[0][1] == ((float) ((((0.5f) < (float_Array_0[0][0])) ? (0.5f) : (float_Array_0[0][0]))))) : (float_Array_0[0][1] == ((float) ((((float_Array_0[0][0]) < (float_Array_0[1][0])) ? (float_Array_0[0][0]) : (float_Array_0[1][0]))))))) && ((float_Array_0[1][0] >= ((((((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) < (float_Array_0[0][1])) ? (((((128.175f) > (float_Array_0[0][0])) ? (128.175f) : (float_Array_0[0][0])))) : (float_Array_0[0][1])))) ? (float_Array_0[1][1] == ((float) float_Array_0[1][0])) : ((! (unsigned_long_int_Array_0[0][0] <= unsigned_long_int_Array_0[1][0])) ? (float_Array_0[1][1] == ((float) float_Array_0[0][0])) : 1))) && ((float_Array_0[0][0] != float_Array_0[1][0]) ? ((BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[1][0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1645 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1632 mSDsluCounter, 14619 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12050 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2822 IncrementalHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 2569 mSDtfsCounter, 2822 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 856 GetRequests, 748 SyntacticMatches, 6 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=801occurred in iteration=9, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 401 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1953 NumberOfCodeBlocks, 1953 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1937 ConstructedInterpolants, 0 QuantifiedInterpolants, 11095 SizeOfPredicates, 6 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 7821/7956 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:10:57,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:11:00,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:11:00,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:11:00,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:11:00,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:11:00,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:11:00,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:11:00,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:11:00,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:11:00,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:11:00,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:11:00,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:11:00,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:11:00,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:11:00,249 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:11:00,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:11:00,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:11:00,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:11:00,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:11:00,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:11:00,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:11:00,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:11:00,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:11:00,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:11:00,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:11:00,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:11:00,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:11:00,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:11:00,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:11:00,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:11:00,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:11:00,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:11:00,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:11:00,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:11:00,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:11:00,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:11:00,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:11:00,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:11:00,267 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:11:00,267 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:11:00,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:11:00,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:11:00,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:11:00,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:11:00,270 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b [2024-11-16 18:11:00,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:11:00,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:11:00,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:11:00,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:11:00,634 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:11:00,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i [2024-11-16 18:11:02,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:11:02,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:11:02,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i [2024-11-16 18:11:02,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fecc8853/e4cb21102dd84fc084c3bd255f4b4714/FLAGefcd2ca0d [2024-11-16 18:11:02,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fecc8853/e4cb21102dd84fc084c3bd255f4b4714 [2024-11-16 18:11:02,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:11:02,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:11:02,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:11:02,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:11:02,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:11:02,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:02,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99d277c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02, skipping insertion in model container [2024-11-16 18:11:02,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:02,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:11:02,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i[916,929] [2024-11-16 18:11:02,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:11:02,767 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:11:02,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i[916,929] [2024-11-16 18:11:02,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:11:02,875 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:11:02,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02 WrapperNode [2024-11-16 18:11:02,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:11:02,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:11:02,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:11:02,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:11:02,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:02,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:02,946 INFO L138 Inliner]: procedures = 36, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 557 [2024-11-16 18:11:02,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:11:02,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:11:02,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:11:02,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:11:02,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:02,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:02,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:03,025 INFO L175 MemorySlicer]: Split 146 memory accesses to 5 slices as follows [2, 33, 56, 35, 20]. 38 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 4, 4, 2]. The 19 writes are split as follows [0, 6, 6, 5, 2]. [2024-11-16 18:11:03,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:03,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:03,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:03,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:03,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:03,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:03,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:11:03,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:11:03,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:11:03,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:11:03,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (1/1) ... [2024-11-16 18:11:03,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:11:03,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:11:03,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:11:03,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:11:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:11:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:11:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:11:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 18:11:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-16 18:11:03,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-16 18:11:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-16 18:11:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-16 18:11:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-16 18:11:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-16 18:11:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-16 18:11:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:11:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:11:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 18:11:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-16 18:11:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-16 18:11:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-16 18:11:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-16 18:11:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-16 18:11:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-16 18:11:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-16 18:11:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-16 18:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-16 18:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-16 18:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:11:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-16 18:11:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-16 18:11:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-16 18:11:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-16 18:11:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-16 18:11:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-16 18:11:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-16 18:11:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-16 18:11:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:11:03,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:11:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:11:03,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:11:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:11:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:11:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-16 18:11:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-16 18:11:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-16 18:11:03,377 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:11:03,383 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:11:03,968 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem91#1;havoc property_#t~ite107#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem103#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite120#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem131#1;havoc property_#t~mem122#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~ite130#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite139#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite155#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1; [2024-11-16 18:11:04,037 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2024-11-16 18:11:04,038 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:11:04,057 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:11:04,058 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:11:04,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:11:04 BoogieIcfgContainer [2024-11-16 18:11:04,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:11:04,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:11:04,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:11:04,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:11:04,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:11:02" (1/3) ... [2024-11-16 18:11:04,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405cb726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:11:04, skipping insertion in model container [2024-11-16 18:11:04,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:11:02" (2/3) ... [2024-11-16 18:11:04,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405cb726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:11:04, skipping insertion in model container [2024-11-16 18:11:04,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:11:04" (3/3) ... [2024-11-16 18:11:04,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-25.i [2024-11-16 18:11:04,087 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:11:04,088 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:11:04,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:11:04,172 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;@77507b78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:11:04,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:11:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 107 states have internal predecessors, (150), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:11:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:11:04,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:04,194 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:04,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:04,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1233751539, now seen corresponding path program 1 times [2024-11-16 18:11:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:04,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630042298] [2024-11-16 18:11:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:04,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:04,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:04,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:04,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 18:11:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:04,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:11:04,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-11-16 18:11:04,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:11:04,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:04,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630042298] [2024-11-16 18:11:04,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630042298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:11:04,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:11:04,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:11:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418707470] [2024-11-16 18:11:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:11:04,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:04,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:11:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:11:04,781 INFO L87 Difference]: Start difference. First operand has 127 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 107 states have internal predecessors, (150), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:11:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:04,826 INFO L93 Difference]: Finished difference Result 246 states and 383 transitions. [2024-11-16 18:11:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:11:04,828 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-11-16 18:11:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:04,837 INFO L225 Difference]: With dead ends: 246 [2024-11-16 18:11:04,837 INFO L226 Difference]: Without dead ends: 122 [2024-11-16 18:11:04,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:11:04,847 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:04,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:11:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-16 18:11:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-16 18:11:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:11:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-16 18:11:04,910 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 146 [2024-11-16 18:11:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:04,911 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-16 18:11:04,911 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:11:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-16 18:11:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:11:04,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:04,917 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:04,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 18:11:05,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:05,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -530871741, now seen corresponding path program 1 times [2024-11-16 18:11:05,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:05,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660483170] [2024-11-16 18:11:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:05,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:05,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:05,126 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:05,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 18:11:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:05,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:11:05,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:06,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:06,512 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 97 treesize of output 37 [2024-11-16 18:11:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-16 18:11:06,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:11:06,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:06,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660483170] [2024-11-16 18:11:06,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660483170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:11:06,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:11:06,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:11:06,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343008545] [2024-11-16 18:11:06,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:06,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:11:06,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:06,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:11:06,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:11:06,591 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:11:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:08,239 INFO L93 Difference]: Finished difference Result 436 states and 636 transitions. [2024-11-16 18:11:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:11:08,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-11-16 18:11:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:08,244 INFO L225 Difference]: With dead ends: 436 [2024-11-16 18:11:08,244 INFO L226 Difference]: Without dead ends: 317 [2024-11-16 18:11:08,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:11:08,246 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 373 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:08,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 806 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 18:11:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-16 18:11:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 309. [2024-11-16 18:11:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 263 states have (on average 1.4068441064638784) internal successors, (370), 265 states have internal predecessors, (370), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 18:11:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 454 transitions. [2024-11-16 18:11:08,298 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 454 transitions. Word has length 146 [2024-11-16 18:11:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:08,299 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 454 transitions. [2024-11-16 18:11:08,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:11:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 454 transitions. [2024-11-16 18:11:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:11:08,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:08,303 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:08,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 18:11:08,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:08,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:08,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:08,507 INFO L85 PathProgramCache]: Analyzing trace with hash -939695966, now seen corresponding path program 1 times [2024-11-16 18:11:08,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:08,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305524959] [2024-11-16 18:11:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:08,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:08,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:08,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 18:11:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:08,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 18:11:08,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:08,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:11:09,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-16 18:11:10,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:10,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2024-11-16 18:11:10,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:10,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 24 [2024-11-16 18:11:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 158 proven. 84 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-16 18:11:10,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:11:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 84 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-16 18:11:10,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305524959] [2024-11-16 18:11:10,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305524959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:11:10,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:11:10,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2024-11-16 18:11:10,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132960415] [2024-11-16 18:11:10,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:11:10,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 18:11:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:10,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 18:11:10,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:11:10,599 INFO L87 Difference]: Start difference. First operand 309 states and 454 transitions. Second operand has 19 states, 15 states have (on average 6.533333333333333) internal successors, (98), 18 states have internal predecessors, (98), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-16 18:11:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:12,038 INFO L93 Difference]: Finished difference Result 914 states and 1302 transitions. [2024-11-16 18:11:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-16 18:11:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 6.533333333333333) internal successors, (98), 18 states have internal predecessors, (98), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) Word has length 146 [2024-11-16 18:11:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:12,048 INFO L225 Difference]: With dead ends: 914 [2024-11-16 18:11:12,048 INFO L226 Difference]: Without dead ends: 608 [2024-11-16 18:11:12,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=372, Invalid=1268, Unknown=0, NotChecked=0, Total=1640 [2024-11-16 18:11:12,056 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 678 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:12,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1147 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 18:11:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-16 18:11:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 575. [2024-11-16 18:11:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 478 states have (on average 1.3640167364016735) internal successors, (652), 483 states have internal predecessors, (652), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-16 18:11:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 808 transitions. [2024-11-16 18:11:12,116 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 808 transitions. Word has length 146 [2024-11-16 18:11:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:12,116 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 808 transitions. [2024-11-16 18:11:12,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 6.533333333333333) internal successors, (98), 18 states have internal predecessors, (98), 7 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-16 18:11:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 808 transitions. [2024-11-16 18:11:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:11:12,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:12,121 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:12,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 18:11:12,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:12,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 43373540, now seen corresponding path program 1 times [2024-11-16 18:11:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628526765] [2024-11-16 18:11:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:12,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:12,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 18:11:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:12,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:11:12,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:12,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:11:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:12,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:11:12,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628526765] [2024-11-16 18:11:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628526765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:11:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:11:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:11:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726006325] [2024-11-16 18:11:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:12,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:11:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:11:12,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:11:12,692 INFO L87 Difference]: Start difference. First operand 575 states and 808 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:13,178 INFO L93 Difference]: Finished difference Result 1384 states and 1951 transitions. [2024-11-16 18:11:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:11:13,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:11:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:13,184 INFO L225 Difference]: With dead ends: 1384 [2024-11-16 18:11:13,185 INFO L226 Difference]: Without dead ends: 812 [2024-11-16 18:11:13,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:11:13,187 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 157 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:13,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 570 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:11:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-11-16 18:11:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 607. [2024-11-16 18:11:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 515 states have internal predecessors, (697), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-16 18:11:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 853 transitions. [2024-11-16 18:11:13,253 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 853 transitions. Word has length 147 [2024-11-16 18:11:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:13,253 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 853 transitions. [2024-11-16 18:11:13,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 853 transitions. [2024-11-16 18:11:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:11:13,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:13,256 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:13,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 18:11:13,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:13,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:13,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1512194422, now seen corresponding path program 1 times [2024-11-16 18:11:13,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:13,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310518636] [2024-11-16 18:11:13,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:13,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:13,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:13,462 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:13,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 18:11:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:13,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:11:13,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:13,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:11:13,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310518636] [2024-11-16 18:11:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310518636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:11:13,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:11:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:11:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796571083] [2024-11-16 18:11:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:13,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:11:13,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:13,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:11:13,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:11:13,805 INFO L87 Difference]: Start difference. First operand 607 states and 853 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:13,867 INFO L93 Difference]: Finished difference Result 1226 states and 1723 transitions. [2024-11-16 18:11:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:11:13,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-16 18:11:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:13,873 INFO L225 Difference]: With dead ends: 1226 [2024-11-16 18:11:13,873 INFO L226 Difference]: Without dead ends: 622 [2024-11-16 18:11:13,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:11:13,875 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:13,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:11:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-16 18:11:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2024-11-16 18:11:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 525 states have (on average 1.3561904761904762) internal successors, (712), 530 states have internal predecessors, (712), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-16 18:11:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 868 transitions. [2024-11-16 18:11:13,943 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 868 transitions. Word has length 149 [2024-11-16 18:11:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:13,944 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 868 transitions. [2024-11-16 18:11:13,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 868 transitions. [2024-11-16 18:11:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:11:13,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:13,948 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:13,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-16 18:11:14,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:14,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -194062145, now seen corresponding path program 1 times [2024-11-16 18:11:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:14,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618858840] [2024-11-16 18:11:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:14,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:14,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:14,153 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:14,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-16 18:11:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:14,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:11:14,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:14,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:11:14,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:14,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618858840] [2024-11-16 18:11:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618858840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:11:14,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:11:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:11:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112999952] [2024-11-16 18:11:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:14,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:11:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:11:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:11:14,463 INFO L87 Difference]: Start difference. First operand 622 states and 868 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:14,583 INFO L93 Difference]: Finished difference Result 1247 states and 1743 transitions. [2024-11-16 18:11:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:11:14,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-16 18:11:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:14,590 INFO L225 Difference]: With dead ends: 1247 [2024-11-16 18:11:14,590 INFO L226 Difference]: Without dead ends: 628 [2024-11-16 18:11:14,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:11:14,593 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:14,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 498 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:11:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-16 18:11:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2024-11-16 18:11:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 529 states have (on average 1.3572778827977316) internal successors, (718), 534 states have internal predecessors, (718), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-16 18:11:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 874 transitions. [2024-11-16 18:11:14,660 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 874 transitions. Word has length 150 [2024-11-16 18:11:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:14,660 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 874 transitions. [2024-11-16 18:11:14,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 874 transitions. [2024-11-16 18:11:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:11:14,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:14,664 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:14,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-16 18:11:14,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:14,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash -163042338, now seen corresponding path program 1 times [2024-11-16 18:11:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613925282] [2024-11-16 18:11:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:14,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:14,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:14,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:14,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 18:11:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:15,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:11:15,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:15,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-16 18:11:15,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:15,263 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 28 treesize of output 14 [2024-11-16 18:11:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:15,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:11:15,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613925282] [2024-11-16 18:11:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613925282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:11:15,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:11:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:11:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836568919] [2024-11-16 18:11:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:11:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:11:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:11:15,276 INFO L87 Difference]: Start difference. First operand 626 states and 874 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:15,483 INFO L93 Difference]: Finished difference Result 1380 states and 1933 transitions. [2024-11-16 18:11:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:11:15,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-16 18:11:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:15,488 INFO L225 Difference]: With dead ends: 1380 [2024-11-16 18:11:15,488 INFO L226 Difference]: Without dead ends: 757 [2024-11-16 18:11:15,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 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-11-16 18:11:15,490 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 89 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:15,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1125 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:11:15,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-11-16 18:11:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 632. [2024-11-16 18:11:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 535 states have (on average 1.3532710280373832) internal successors, (724), 540 states have internal predecessors, (724), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-16 18:11:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 880 transitions. [2024-11-16 18:11:15,530 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 880 transitions. Word has length 150 [2024-11-16 18:11:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:15,530 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 880 transitions. [2024-11-16 18:11:15,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 880 transitions. [2024-11-16 18:11:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:11:15,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:15,533 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:15,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-16 18:11:15,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:15,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:15,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash -448798690, now seen corresponding path program 1 times [2024-11-16 18:11:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:15,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973422721] [2024-11-16 18:11:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:15,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:15,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:15,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:15,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-16 18:11:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:16,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 18:11:16,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:16,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-16 18:11:16,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-11-16 18:11:17,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:17,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 45 [2024-11-16 18:11:17,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:17,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 27 [2024-11-16 18:11:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 160 proven. 84 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-16 18:11:17,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:11:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 84 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-16 18:11:18,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:18,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973422721] [2024-11-16 18:11:18,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973422721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:11:18,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:11:18,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-16 18:11:18,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661733576] [2024-11-16 18:11:18,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:11:18,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 18:11:18,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 18:11:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-11-16 18:11:18,018 INFO L87 Difference]: Start difference. First operand 632 states and 880 transitions. Second operand has 23 states, 19 states have (on average 5.578947368421052) internal successors, (106), 20 states have internal predecessors, (106), 7 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-16 18:11:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:19,378 INFO L93 Difference]: Finished difference Result 1257 states and 1733 transitions. [2024-11-16 18:11:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 18:11:19,379 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 5.578947368421052) internal successors, (106), 20 states have internal predecessors, (106), 7 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 150 [2024-11-16 18:11:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:19,382 INFO L225 Difference]: With dead ends: 1257 [2024-11-16 18:11:19,382 INFO L226 Difference]: Without dead ends: 628 [2024-11-16 18:11:19,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=415, Invalid=1307, Unknown=0, NotChecked=0, Total=1722 [2024-11-16 18:11:19,385 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 451 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:19,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1374 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 18:11:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-16 18:11:19,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 358. [2024-11-16 18:11:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 303 states have (on average 1.33993399339934) internal successors, (406), 305 states have internal predecessors, (406), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 18:11:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 490 transitions. [2024-11-16 18:11:19,415 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 490 transitions. Word has length 150 [2024-11-16 18:11:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:19,415 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 490 transitions. [2024-11-16 18:11:19,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 5.578947368421052) internal successors, (106), 20 states have internal predecessors, (106), 7 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-11-16 18:11:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 490 transitions. [2024-11-16 18:11:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 18:11:19,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:19,417 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:19,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-16 18:11:19,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:19,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:19,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash 679964744, now seen corresponding path program 1 times [2024-11-16 18:11:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:19,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792307602] [2024-11-16 18:11:19,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:19,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:19,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:19,623 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:19,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-16 18:11:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:19,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:11:19,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:19,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:19,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2024-11-16 18:11:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:19,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:11:19,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:19,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792307602] [2024-11-16 18:11:19,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792307602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:11:19,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:11:19,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:11:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087626562] [2024-11-16 18:11:19,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:19,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:11:19,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:19,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:11:19,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:11:19,997 INFO L87 Difference]: Start difference. First operand 358 states and 490 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:20,247 INFO L93 Difference]: Finished difference Result 1006 states and 1372 transitions. [2024-11-16 18:11:20,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:11:20,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-11-16 18:11:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:20,252 INFO L225 Difference]: With dead ends: 1006 [2024-11-16 18:11:20,252 INFO L226 Difference]: Without dead ends: 651 [2024-11-16 18:11:20,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:11:20,255 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 128 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:20,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 930 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:11:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-16 18:11:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 646. [2024-11-16 18:11:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 545 states have (on average 1.3321100917431192) internal successors, (726), 551 states have internal predecessors, (726), 76 states have call successors, (76), 24 states have call predecessors, (76), 24 states have return successors, (76), 70 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-16 18:11:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 878 transitions. [2024-11-16 18:11:20,328 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 878 transitions. Word has length 151 [2024-11-16 18:11:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:20,331 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 878 transitions. [2024-11-16 18:11:20,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 878 transitions. [2024-11-16 18:11:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:11:20,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:20,334 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:20,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-16 18:11:20,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:20,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:20,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1400250810, now seen corresponding path program 1 times [2024-11-16 18:11:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:20,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767137816] [2024-11-16 18:11:20,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:20,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:20,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:20,547 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:20,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-16 18:11:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:20,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 18:11:20,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:21,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-16 18:11:21,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:21,064 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 36 treesize of output 16 [2024-11-16 18:11:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 251 proven. 12 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-11-16 18:11:21,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:11:21,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:21,205 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 45 treesize of output 25 [2024-11-16 18:11:21,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767137816] [2024-11-16 18:11:21,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767137816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:11:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [79531398] [2024-11-16 18:11:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:21,299 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:11:21,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:11:21,300 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:11:21,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-16 18:11:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:22,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 18:11:22,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:22,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-16 18:11:22,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:22,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2024-11-16 18:11:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 251 proven. 12 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-11-16 18:11:22,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:11:22,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:22,762 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 45 treesize of output 25 [2024-11-16 18:11:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [79531398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:11:22,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:11:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-16 18:11:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033215525] [2024-11-16 18:11:22,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:11:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 18:11:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 18:11:22,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:11:22,846 INFO L87 Difference]: Start difference. First operand 646 states and 878 transitions. Second operand has 16 states, 14 states have (on average 8.285714285714286) internal successors, (116), 16 states have internal predecessors, (116), 6 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) [2024-11-16 18:11:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:23,576 INFO L93 Difference]: Finished difference Result 1337 states and 1797 transitions. [2024-11-16 18:11:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 18:11:23,578 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.285714285714286) internal successors, (116), 16 states have internal predecessors, (116), 6 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) Word has length 153 [2024-11-16 18:11:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:23,582 INFO L225 Difference]: With dead ends: 1337 [2024-11-16 18:11:23,582 INFO L226 Difference]: Without dead ends: 694 [2024-11-16 18:11:23,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 355 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2024-11-16 18:11:23,584 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 360 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:23,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 924 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:11:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-16 18:11:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 646. [2024-11-16 18:11:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 547 states have (on average 1.3254113345521024) internal successors, (725), 553 states have internal predecessors, (725), 72 states have call successors, (72), 26 states have call predecessors, (72), 26 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 18:11:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 869 transitions. [2024-11-16 18:11:23,645 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 869 transitions. Word has length 153 [2024-11-16 18:11:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:23,645 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 869 transitions. [2024-11-16 18:11:23,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.285714285714286) internal successors, (116), 16 states have internal predecessors, (116), 6 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) [2024-11-16 18:11:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 869 transitions. [2024-11-16 18:11:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:11:23,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:23,648 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:23,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-16 18:11:23,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-16 18:11:24,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 18:11:24,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:24,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:24,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1654987355, now seen corresponding path program 1 times [2024-11-16 18:11:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:24,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756530567] [2024-11-16 18:11:24,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:24,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:24,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:24,051 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:24,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-16 18:11:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:24,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 18:11:24,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:24,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:11:24,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-16 18:11:24,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-16 18:11:24,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-16 18:11:24,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-16 18:11:24,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:24,972 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 54 treesize of output 24 [2024-11-16 18:11:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 12 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-16 18:11:25,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:11:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:25,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756530567] [2024-11-16 18:11:25,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756530567] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:11:25,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:11:25,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2024-11-16 18:11:25,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796979876] [2024-11-16 18:11:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:25,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:11:25,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:11:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:11:25,219 INFO L87 Difference]: Start difference. First operand 646 states and 869 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:25,518 INFO L93 Difference]: Finished difference Result 1302 states and 1745 transitions. [2024-11-16 18:11:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:11:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-11-16 18:11:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:25,523 INFO L225 Difference]: With dead ends: 1302 [2024-11-16 18:11:25,523 INFO L226 Difference]: Without dead ends: 659 [2024-11-16 18:11:25,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:11:25,525 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 226 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:25,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 533 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:11:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-16 18:11:25,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 425. [2024-11-16 18:11:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 366 states have (on average 1.3278688524590163) internal successors, (486), 368 states have internal predecessors, (486), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 18:11:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 570 transitions. [2024-11-16 18:11:25,571 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 570 transitions. Word has length 153 [2024-11-16 18:11:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:25,571 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 570 transitions. [2024-11-16 18:11:25,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 570 transitions. [2024-11-16 18:11:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:11:25,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:25,574 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:25,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-16 18:11:25,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:25,774 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:25,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2134421316, now seen corresponding path program 1 times [2024-11-16 18:11:25,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902233461] [2024-11-16 18:11:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:25,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:25,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:25,777 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:25,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-16 18:11:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:26,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-16 18:11:26,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:26,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-16 18:11:26,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-16 18:11:26,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:26,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2024-11-16 18:11:27,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:11:27,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:11:27,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:27,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 58 [2024-11-16 18:11:28,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-16 18:11:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 377 proven. 57 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-16 18:11:28,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:11:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:30,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902233461] [2024-11-16 18:11:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902233461] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:11:30,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:11:30,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [27] total 35 [2024-11-16 18:11:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307811027] [2024-11-16 18:11:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:30,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:11:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:11:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2024-11-16 18:11:30,131 INFO L87 Difference]: Start difference. First operand 425 states and 570 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:31,521 INFO L93 Difference]: Finished difference Result 1331 states and 1770 transitions. [2024-11-16 18:11:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 18:11:31,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-11-16 18:11:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:31,526 INFO L225 Difference]: With dead ends: 1331 [2024-11-16 18:11:31,526 INFO L226 Difference]: Without dead ends: 909 [2024-11-16 18:11:31,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 18:11:31,528 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 234 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:31,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 2208 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 18:11:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-16 18:11:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 677. [2024-11-16 18:11:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 584 states have (on average 1.3304794520547945) internal successors, (777), 590 states have internal predecessors, (777), 64 states have call successors, (64), 28 states have call predecessors, (64), 28 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 18:11:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 905 transitions. [2024-11-16 18:11:31,603 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 905 transitions. Word has length 153 [2024-11-16 18:11:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:31,604 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 905 transitions. [2024-11-16 18:11:31,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 905 transitions. [2024-11-16 18:11:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:11:31,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:31,606 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:31,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-16 18:11:31,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:31,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:31,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:31,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1396378391, now seen corresponding path program 1 times [2024-11-16 18:11:31,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:31,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884033825] [2024-11-16 18:11:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:31,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:31,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:31,809 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:31,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-16 18:11:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:32,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 18:11:32,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:32,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:32,424 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 124 treesize of output 46 [2024-11-16 18:11:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-16 18:11:32,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:11:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:32,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884033825] [2024-11-16 18:11:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884033825] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:11:32,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:11:32,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-16 18:11:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283969210] [2024-11-16 18:11:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:32,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:11:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:11:32,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:11:32,648 INFO L87 Difference]: Start difference. First operand 677 states and 905 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:33,483 INFO L93 Difference]: Finished difference Result 1541 states and 2055 transitions. [2024-11-16 18:11:33,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:11:33,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-11-16 18:11:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:33,488 INFO L225 Difference]: With dead ends: 1541 [2024-11-16 18:11:33,488 INFO L226 Difference]: Without dead ends: 867 [2024-11-16 18:11:33,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:11:33,491 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 186 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:33,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 415 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:11:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-11-16 18:11:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 860. [2024-11-16 18:11:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 747 states have (on average 1.3266398929049532) internal successors, (991), 755 states have internal predecessors, (991), 76 states have call successors, (76), 36 states have call predecessors, (76), 36 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-16 18:11:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1143 transitions. [2024-11-16 18:11:33,589 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1143 transitions. Word has length 153 [2024-11-16 18:11:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:33,590 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1143 transitions. [2024-11-16 18:11:33,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1143 transitions. [2024-11-16 18:11:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:11:33,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:33,592 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:33,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-16 18:11:33,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:33,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:33,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1463385144, now seen corresponding path program 1 times [2024-11-16 18:11:33,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:33,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601167213] [2024-11-16 18:11:33,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:33,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:33,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:33,795 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:33,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-16 18:11:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:35,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-16 18:11:35,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:35,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-16 18:11:35,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-16 18:11:35,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:35,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2024-11-16 18:11:35,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 15 treesize of output 1 [2024-11-16 18:11:35,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:11:36,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:36,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 58 [2024-11-16 18:11:36,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-16 18:11:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 377 proven. 57 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-16 18:11:37,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:11:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:38,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:38,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601167213] [2024-11-16 18:11:38,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601167213] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:11:38,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:11:38,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [27] total 35 [2024-11-16 18:11:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096248699] [2024-11-16 18:11:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:38,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:11:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:38,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:11:38,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2024-11-16 18:11:38,999 INFO L87 Difference]: Start difference. First operand 860 states and 1143 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:40,544 INFO L93 Difference]: Finished difference Result 2070 states and 2726 transitions. [2024-11-16 18:11:40,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 18:11:40,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-11-16 18:11:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:40,549 INFO L225 Difference]: With dead ends: 2070 [2024-11-16 18:11:40,550 INFO L226 Difference]: Without dead ends: 1213 [2024-11-16 18:11:40,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 18:11:40,552 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 231 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 3090 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:40,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 3090 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 18:11:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-11-16 18:11:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 851. [2024-11-16 18:11:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 723 states have (on average 1.3084370677731674) internal successors, (946), 733 states have internal predecessors, (946), 85 states have call successors, (85), 42 states have call predecessors, (85), 42 states have return successors, (85), 75 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-16 18:11:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1116 transitions. [2024-11-16 18:11:40,656 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1116 transitions. Word has length 153 [2024-11-16 18:11:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:40,656 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1116 transitions. [2024-11-16 18:11:40,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1116 transitions. [2024-11-16 18:11:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:11:40,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:40,658 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:40,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-16 18:11:40,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:40,859 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:40,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1720212334, now seen corresponding path program 1 times [2024-11-16 18:11:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56999646] [2024-11-16 18:11:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:40,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:40,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:40,862 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:40,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-16 18:11:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:41,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 18:11:41,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:41,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-16 18:11:41,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-16 18:11:42,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-16 18:11:42,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-16 18:11:42,115 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 70 treesize of output 34 [2024-11-16 18:11:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-16 18:11:42,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:11:42,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:42,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56999646] [2024-11-16 18:11:42,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56999646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:11:42,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:11:42,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:11:42,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933376673] [2024-11-16 18:11:42,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:42,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:11:42,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:11:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:11:42,156 INFO L87 Difference]: Start difference. First operand 851 states and 1116 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:11:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:43,321 INFO L93 Difference]: Finished difference Result 2446 states and 3219 transitions. [2024-11-16 18:11:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:11:43,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-16 18:11:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:43,332 INFO L225 Difference]: With dead ends: 2446 [2024-11-16 18:11:43,332 INFO L226 Difference]: Without dead ends: 1653 [2024-11-16 18:11:43,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:11:43,336 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 321 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:43,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 628 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 18:11:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-11-16 18:11:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1414. [2024-11-16 18:11:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1209 states have (on average 1.3110008271298594) internal successors, (1585), 1229 states have internal predecessors, (1585), 140 states have call successors, (140), 64 states have call predecessors, (140), 64 states have return successors, (140), 120 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-16 18:11:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1865 transitions. [2024-11-16 18:11:43,516 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1865 transitions. Word has length 153 [2024-11-16 18:11:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:43,517 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 1865 transitions. [2024-11-16 18:11:43,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:11:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1865 transitions. [2024-11-16 18:11:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:11:43,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:43,520 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:43,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-16 18:11:43,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:43,721 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:43,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1849295053, now seen corresponding path program 1 times [2024-11-16 18:11:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510536535] [2024-11-16 18:11:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:43,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:43,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:43,726 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:43,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-16 18:11:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:44,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-16 18:11:44,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:44,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:11:44,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-16 18:11:45,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:45,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 89 [2024-11-16 18:11:45,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:45,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 80 [2024-11-16 18:11:45,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:45,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 73 [2024-11-16 18:11:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 308 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-16 18:11:45,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:11:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:46,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510536535] [2024-11-16 18:11:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510536535] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:11:46,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:11:46,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 27 [2024-11-16 18:11:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54929795] [2024-11-16 18:11:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:46,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:11:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:46,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:11:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2024-11-16 18:11:46,394 INFO L87 Difference]: Start difference. First operand 1414 states and 1865 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:47,493 INFO L93 Difference]: Finished difference Result 3151 states and 4155 transitions. [2024-11-16 18:11:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:11:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-11-16 18:11:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:47,500 INFO L225 Difference]: With dead ends: 3151 [2024-11-16 18:11:47,500 INFO L226 Difference]: Without dead ends: 1816 [2024-11-16 18:11:47,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2024-11-16 18:11:47,503 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 241 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:47,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1375 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 18:11:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-11-16 18:11:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1570. [2024-11-16 18:11:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1365 states have (on average 1.3164835164835165) internal successors, (1797), 1385 states have internal predecessors, (1797), 140 states have call successors, (140), 64 states have call predecessors, (140), 64 states have return successors, (140), 120 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-16 18:11:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2077 transitions. [2024-11-16 18:11:47,684 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2077 transitions. Word has length 153 [2024-11-16 18:11:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:47,684 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2077 transitions. [2024-11-16 18:11:47,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2077 transitions. [2024-11-16 18:11:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:11:47,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:47,687 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:47,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-16 18:11:47,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:47,888 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:47,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1829906958, now seen corresponding path program 1 times [2024-11-16 18:11:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:47,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354638152] [2024-11-16 18:11:47,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:47,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:47,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:47,891 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:47,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-16 18:11:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:48,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:11:48,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:11:48,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:11:48,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2024-11-16 18:11:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:11:48,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:11:48,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:11:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354638152] [2024-11-16 18:11:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354638152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:11:48,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:11:48,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:11:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723265079] [2024-11-16 18:11:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:11:48,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:11:48,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:11:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:11:48,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:11:48,261 INFO L87 Difference]: Start difference. First operand 1570 states and 2077 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:11:48,603 INFO L93 Difference]: Finished difference Result 4024 states and 5321 transitions. [2024-11-16 18:11:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:11:48,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-11-16 18:11:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:11:48,614 INFO L225 Difference]: With dead ends: 4024 [2024-11-16 18:11:48,614 INFO L226 Difference]: Without dead ends: 2533 [2024-11-16 18:11:48,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:11:48,616 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 101 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:11:48,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 809 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:11:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2024-11-16 18:11:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 1710. [2024-11-16 18:11:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1505 states have (on average 1.324252491694352) internal successors, (1993), 1525 states have internal predecessors, (1993), 140 states have call successors, (140), 64 states have call predecessors, (140), 64 states have return successors, (140), 120 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-16 18:11:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2273 transitions. [2024-11-16 18:11:48,774 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2273 transitions. Word has length 153 [2024-11-16 18:11:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:11:48,775 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2273 transitions. [2024-11-16 18:11:48,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:11:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2273 transitions. [2024-11-16 18:11:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 18:11:48,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:11:48,779 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:11:48,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-16 18:11:48,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:48,980 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:11:48,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:11:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1805960273, now seen corresponding path program 1 times [2024-11-16 18:11:48,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:11:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601456384] [2024-11-16 18:11:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:11:48,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:11:48,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:11:48,982 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:11:48,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-16 18:11:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:11:49,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:11:49,276 INFO L278 TraceCheckSpWp]: Computing forward predicates...