./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:23:27,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:23:27,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:23:27,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:23:27,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:23:27,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:23:27,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:23:27,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:23:27,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:23:27,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:23:27,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:23:27,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:23:27,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:23:27,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:23:27,998 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:23:27,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:23:27,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:23:27,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:23:27,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:23:27,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:23:27,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:23:28,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:23:28,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:23:28,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:23:28,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:23:28,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:23:28,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:23:28,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:23:28,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:23:28,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:23:28,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:23:28,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:23:28,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:23:28,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:23:28,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:23:28,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:23:28,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:23:28,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:23:28,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:23:28,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:23:28,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:23:28,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:23:28,006 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2024-11-20 08:23:28,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:23:28,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:23:28,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:23:28,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:23:28,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:23:28,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-20 08:23:29,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:23:29,568 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:23:29,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-20 08:23:29,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1066d6ba/a317291ef25843279d14feff8e3e569e/FLAG9e8999740 [2024-11-20 08:23:29,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1066d6ba/a317291ef25843279d14feff8e3e569e [2024-11-20 08:23:29,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:23:29,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:23:29,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:23:29,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:23:29,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:23:29,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e876a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29, skipping insertion in model container [2024-11-20 08:23:29,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:23:29,752 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-29.i[916,929] [2024-11-20 08:23:29,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:23:29,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:23:29,806 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-29.i[916,929] [2024-11-20 08:23:29,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:23:29,867 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:23:29,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29 WrapperNode [2024-11-20 08:23:29,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:23:29,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:23:29,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:23:29,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:23:29,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,927 INFO L138 Inliner]: procedures = 29, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-11-20 08:23:29,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:23:29,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:23:29,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:23:29,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:23:29,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,973 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2024-11-20 08:23:29,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:29,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:30,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:23:30,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:23:30,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:23:30,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:23:30,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (1/1) ... [2024-11-20 08:23:30,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:23:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:23:30,037 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-20 08:23:30,039 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-20 08:23:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:23:30,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:23:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:23:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:23:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:23:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:23:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:23:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:23:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:23:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:23:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:23:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:23:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:23:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:23:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:23:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:23:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:23:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:23:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:23:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:23:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:23:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:23:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:23:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:23:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:23:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:23:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:23:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:23:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:23:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:23:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:23:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:23:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:23:30,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:23:30,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:23:30,197 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:23:30,199 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:23:30,500 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-20 08:23:30,500 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:23:30,516 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:23:30,517 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:23:30,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:30 BoogieIcfgContainer [2024-11-20 08:23:30,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:23:30,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:23:30,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:23:30,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:23:30,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:23:29" (1/3) ... [2024-11-20 08:23:30,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44affbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:30, skipping insertion in model container [2024-11-20 08:23:30,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:29" (2/3) ... [2024-11-20 08:23:30,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44affbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:30, skipping insertion in model container [2024-11-20 08:23:30,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:30" (3/3) ... [2024-11-20 08:23:30,523 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2024-11-20 08:23:30,536 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:23:30,536 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:23:30,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:23:30,585 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;@f7cb764, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:23:30,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:23:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:30,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:30,596 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:30,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:30,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1620841544, now seen corresponding path program 1 times [2024-11-20 08:23:30,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:23:30,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934941336] [2024-11-20 08:23:30,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:30,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:23:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:30,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:23:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:30,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:23:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:23:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:23:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:23:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:23:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:23:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:23:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934941336] [2024-11-20 08:23:30,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934941336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:30,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:30,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:23:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432465283] [2024-11-20 08:23:30,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:30,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:23:30,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:23:30,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:23:30,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:23:30,894 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:23:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:30,915 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-20 08:23:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:23:30,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-20 08:23:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:30,922 INFO L225 Difference]: With dead ends: 169 [2024-11-20 08:23:30,922 INFO L226 Difference]: Without dead ends: 84 [2024-11-20 08:23:30,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-20 08:23:30,927 INFO L432 NwaCegarLoop]: 120 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, 120 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-20 08:23:30,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:23:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-20 08:23:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-20 08:23:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-20 08:23:30,980 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2024-11-20 08:23:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:30,980 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-20 08:23:30,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:23:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-20 08:23:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:30,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:30,984 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:23:30,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:30,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1061476096, now seen corresponding path program 1 times [2024-11-20 08:23:30,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:23:30,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875629762] [2024-11-20 08:23:30,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:30,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:23:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:23:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:23:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:23:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:23:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:23:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:23:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:23:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:23:31,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875629762] [2024-11-20 08:23:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875629762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:23:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544856200] [2024-11-20 08:23:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:31,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:23:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:23:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:23:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:23:31,187 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:23:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:31,220 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-11-20 08:23:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:23:31,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-20 08:23:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:31,223 INFO L225 Difference]: With dead ends: 167 [2024-11-20 08:23:31,224 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 08:23:31,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-20 08:23:31,225 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:31,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:23:31,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 08:23:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 08:23:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-20 08:23:31,238 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2024-11-20 08:23:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:31,239 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-20 08:23:31,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:23:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-20 08:23:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:31,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:31,242 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:31,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:23:31,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:31,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:31,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1102150846, now seen corresponding path program 1 times [2024-11-20 08:23:31,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:23:31,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718460329] [2024-11-20 08:23:31,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:31,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:23:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:23:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:23:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:23:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:23:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:23:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:23:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:23:31,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:23:31,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718460329] [2024-11-20 08:23:31,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718460329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:31,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:31,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:23:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531349100] [2024-11-20 08:23:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:31,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:23:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:23:31,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:23:31,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:23:31,384 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:31,413 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2024-11-20 08:23:31,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:23:31,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-20 08:23:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:31,417 INFO L225 Difference]: With dead ends: 172 [2024-11-20 08:23:31,418 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 08:23:31,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-20 08:23:31,419 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:31,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:23:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 08:23:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-20 08:23:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2024-11-20 08:23:31,429 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 73 [2024-11-20 08:23:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:31,430 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2024-11-20 08:23:31,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2024-11-20 08:23:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:31,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:31,434 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:31,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:23:31,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:31,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash 672856516, now seen corresponding path program 1 times [2024-11-20 08:23:31,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:23:31,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120655936] [2024-11-20 08:23:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:31,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:23:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:23:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:23:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-20 08:23:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:23:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:23:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:23:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:23:31,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:23:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120655936] [2024-11-20 08:23:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120655936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:23:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107076775] [2024-11-20 08:23:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:31,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:23:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:23:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:23:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:23:31,567 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:31,585 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2024-11-20 08:23:31,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:23:31,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-20 08:23:31,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:31,587 INFO L225 Difference]: With dead ends: 176 [2024-11-20 08:23:31,587 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 08:23:31,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-20 08:23:31,590 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:31,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:23:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 08:23:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-20 08:23:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-11-20 08:23:31,600 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 73 [2024-11-20 08:23:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:31,600 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-11-20 08:23:31,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-20 08:23:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:31,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:31,604 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:31,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:23:31,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:31,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash 674703558, now seen corresponding path program 1 times [2024-11-20 08:23:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:23:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920781857] [2024-11-20 08:23:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:23:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:23:31,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:23:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:23:31,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:23:31,778 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:23:31,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:23:31,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:23:31,781 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 08:23:31,821 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:23:31,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:23:31 BoogieIcfgContainer [2024-11-20 08:23:31,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:23:31,829 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:23:31,829 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:23:31,829 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:23:31,829 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:30" (3/4) ... [2024-11-20 08:23:31,831 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:23:31,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:23:31,833 INFO L158 Benchmark]: Toolchain (without parser) took 2243.52ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 78.2MB in the beginning and 152.0MB in the end (delta: -73.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:23:31,833 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:23:31,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.20ms. Allocated memory is still 151.0MB. Free memory was 77.9MB in the beginning and 120.5MB in the end (delta: -42.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-20 08:23:31,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.02ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 120.5MB in the beginning and 171.1MB in the end (delta: -50.6MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-11-20 08:23:31,836 INFO L158 Benchmark]: Boogie Preprocessor took 74.67ms. Allocated memory is still 201.3MB. Free memory was 171.1MB in the beginning and 166.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:23:31,836 INFO L158 Benchmark]: RCFGBuilder took 514.49ms. Allocated memory is still 201.3MB. Free memory was 166.9MB in the beginning and 135.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-20 08:23:31,836 INFO L158 Benchmark]: TraceAbstraction took 1309.30ms. Allocated memory is still 201.3MB. Free memory was 134.4MB in the beginning and 152.0MB in the end (delta: -17.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:23:31,838 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 201.3MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:23:31,839 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.20ms. Allocated memory is still 151.0MB. Free memory was 77.9MB in the beginning and 120.5MB in the end (delta: -42.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.02ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 120.5MB in the beginning and 171.1MB in the end (delta: -50.6MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.67ms. Allocated memory is still 201.3MB. Free memory was 171.1MB in the beginning and 166.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 514.49ms. Allocated memory is still 201.3MB. Free memory was 166.9MB in the beginning and 135.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1309.30ms. Allocated memory is still 201.3MB. Free memory was 134.4MB in the beginning and 152.0MB in the end (delta: -17.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 201.3MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L25-L27] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L28-L30] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_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_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_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_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] float_Array_0[0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L68] EXPR float_Array_0[0] [L68] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_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_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] float_Array_0[1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L70] EXPR float_Array_0[1] [L70] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_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_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L72] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_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_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_char_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_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET updateVariables() [L87] CALL step() [L37] EXPR BOOL_unsigned_char_Array_0[1] [L37] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L38] EXPR unsigned_char_Array_0[1] [L38] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L39] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND TRUE BOOL_unsigned_char_Array_0[0] [L40] EXPR float_Array_0[1] [L40] float_Array_0[2] = float_Array_0[1] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[2] [L46] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L46] COND FALSE !((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) [L49] EXPR unsigned_char_Array_0[2] [L49] unsigned_short_int_Array_0[1] = unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[2] [L51] signed long int stepLocal_0 = 5 * unsigned_char_Array_0[2]; [L52] EXPR float_Array_0[1] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) [L52] EXPR float_Array_0[1] [L52] EXPR ((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, stepLocal_0=0, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] EXPR float_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L52] COND FALSE !(((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) [L59] EXPR float_Array_0[2] [L59] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] COND TRUE float_Array_0[2] < float_Array_0[1] [L60] EXPR unsigned_char_Array_0[1] [L60] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L87] RET step() [L88] CALL, EXPR property() [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) [L78] EXPR float_Array_0[2] [L78] EXPR float_Array_0[1] [L78] EXPR BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78-L79] return (((((BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) float_Array_0[1])) : ((! (float_Array_0[1] < float_Array_0[0])) ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) < 0 ) ? -(float_Array_0[1]) : (float_Array_0[1]))))) : 1)) && (((float_Array_0[2] + 8.125) > (float_Array_0[2] * float_Array_0[1])) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[2] + unsigned_char_Array_0[2])) : (unsigned_char_Array_0[2]))))) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[2])))) && ((((((float_Array_0[1]) < (float_Array_0[2])) ? (float_Array_0[1]) : (float_Array_0[2]))) == float_Array_0[2]) ? ((unsigned_char_Array_0[2] > (5 * unsigned_char_Array_0[2])) ? ((float_Array_0[2] < (float_Array_0[2] * 256.5f)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[2])) : 1) : 1) : 1)) && ((float_Array_0[2] < float_Array_0[1]) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_char_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_char_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 1146 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 472 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 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-20 08:23:31,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.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 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:23:33,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:23:33,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:23:33,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:23:33,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:23:33,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:23:33,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:23:33,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:23:33,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:23:33,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:23:33,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:23:33,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:23:33,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:23:33,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:23:33,660 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:23:33,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:23:33,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:23:33,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:23:33,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:23:33,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:23:33,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:23:33,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:23:33,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:23:33,663 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:23:33,663 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:23:33,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:23:33,664 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:23:33,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:23:33,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:23:33,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:23:33,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:23:33,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:23:33,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:23:33,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:23:33,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:23:33,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:23:33,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:23:33,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:23:33,666 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:23:33,666 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:23:33,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:23:33,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:23:33,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:23:33,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:23:33,667 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 -> 337c1d5f4ccd8d503a1da6a7ecae828e4d0fb2dc7151ed949254cfee37da55a9 [2024-11-20 08:23:33,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:23:33,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:23:33,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:23:33,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:23:33,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:23:33,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-20 08:23:35,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:23:35,320 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:23:35,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-29.i [2024-11-20 08:23:35,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e83e37a/d0db07327d064fb995c3612cf4d36f55/FLAG280a04fbf [2024-11-20 08:23:35,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e83e37a/d0db07327d064fb995c3612cf4d36f55 [2024-11-20 08:23:35,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:23:35,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:23:35,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:23:35,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:23:35,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:23:35,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a8dff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35, skipping insertion in model container [2024-11-20 08:23:35,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:23:35,534 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-29.i[916,929] [2024-11-20 08:23:35,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:23:35,602 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:23:35,613 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-29.i[916,929] [2024-11-20 08:23:35,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:23:35,674 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:23:35,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35 WrapperNode [2024-11-20 08:23:35,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:23:35,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:23:35,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:23:35,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:23:35,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,728 INFO L138 Inliner]: procedures = 33, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-11-20 08:23:35,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:23:35,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:23:35,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:23:35,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:23:35,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,776 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2024-11-20 08:23:35,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:23:35,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:23:35,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:23:35,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:23:35,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (1/1) ... [2024-11-20 08:23:35,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:23:35,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:23:35,839 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-20 08:23:35,841 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-20 08:23:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:23:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 08:23:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 08:23:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 08:23:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 08:23:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 08:23:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 08:23:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 08:23:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 08:23:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 08:23:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-20 08:23:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:23:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 08:23:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 08:23:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 08:23:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 08:23:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-20 08:23:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-20 08:23:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-20 08:23:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-20 08:23:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-20 08:23:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:23:35,879 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:23:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:23:35,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-20 08:23:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-20 08:23:35,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:23:36,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:23:43,280 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-20 08:23:43,280 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:23:43,292 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:23:43,293 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:23:43,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:43 BoogieIcfgContainer [2024-11-20 08:23:43,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:23:43,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:23:43,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:23:43,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:23:43,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:23:35" (1/3) ... [2024-11-20 08:23:43,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fd1fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:43, skipping insertion in model container [2024-11-20 08:23:43,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:23:35" (2/3) ... [2024-11-20 08:23:43,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fd1fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:23:43, skipping insertion in model container [2024-11-20 08:23:43,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:23:43" (3/3) ... [2024-11-20 08:23:43,301 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-29.i [2024-11-20 08:23:43,312 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:23:43,312 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:23:43,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:23:43,369 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;@1712e2f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:23:43,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:23:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:43,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:43,380 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:43,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:43,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1620841544, now seen corresponding path program 1 times [2024-11-20 08:23:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:43,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284227618] [2024-11-20 08:23:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:43,393 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-20 08:23:43,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:43,395 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-20 08:23:43,396 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-20 08:23:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:43,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:23:43,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-20 08:23:43,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:43,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:43,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284227618] [2024-11-20 08:23:43,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284227618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:43,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:43,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:23:43,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661890094] [2024-11-20 08:23:43,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:43,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:23:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:23:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:23:43,789 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:23:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:43,814 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-20 08:23:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:23:43,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-20 08:23:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:43,824 INFO L225 Difference]: With dead ends: 169 [2024-11-20 08:23:43,825 INFO L226 Difference]: Without dead ends: 84 [2024-11-20 08:23:43,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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-20 08:23:43,830 INFO L432 NwaCegarLoop]: 120 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, 120 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-20 08:23:43,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:23:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-20 08:23:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-20 08:23:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-20 08:23:43,865 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2024-11-20 08:23:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:43,865 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-20 08:23:43,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:23:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-20 08:23:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:43,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:43,867 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:43,877 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-20 08:23:44,068 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-20 08:23:44,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:44,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1061476096, now seen corresponding path program 1 times [2024-11-20 08:23:44,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:44,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008706934] [2024-11-20 08:23:44,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:44,070 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-20 08:23:44,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:44,072 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-20 08:23:44,073 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-20 08:23:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:44,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:23:44,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-20 08:23:44,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:44,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008706934] [2024-11-20 08:23:44,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008706934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:44,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:44,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:23:44,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456172408] [2024-11-20 08:23:44,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:44,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:23:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:44,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:23:44,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:23:44,381 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:23:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:44,458 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-11-20 08:23:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:23:44,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-20 08:23:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:44,462 INFO L225 Difference]: With dead ends: 167 [2024-11-20 08:23:44,462 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 08:23:44,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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-20 08:23:44,464 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:44,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:23:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 08:23:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 08:23:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-20 08:23:44,477 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2024-11-20 08:23:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:44,478 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-20 08:23:44,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:23:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-20 08:23:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:44,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:44,480 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:44,491 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-20 08:23:44,681 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-20 08:23:44,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:44,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1102150846, now seen corresponding path program 1 times [2024-11-20 08:23:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690990315] [2024-11-20 08:23:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:44,684 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-20 08:23:44,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:44,685 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-20 08:23:44,685 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-20 08:23:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:44,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:23:44,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:23:45,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:45,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:45,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690990315] [2024-11-20 08:23:45,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690990315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:45,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:45,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:23:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301903719] [2024-11-20 08:23:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:45,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:23:45,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:45,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:23:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:23:45,012 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:45,102 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2024-11-20 08:23:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:23:45,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-20 08:23:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:45,103 INFO L225 Difference]: With dead ends: 176 [2024-11-20 08:23:45,103 INFO L226 Difference]: Without dead ends: 93 [2024-11-20 08:23:45,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:23:45,105 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:45,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 544 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:23:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-20 08:23:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-20 08:23:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-11-20 08:23:45,110 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 73 [2024-11-20 08:23:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:45,111 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-11-20 08:23:45,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-11-20 08:23:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:45,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:45,112 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:45,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 08:23:45,316 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-20 08:23:45,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:45,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash 672856516, now seen corresponding path program 1 times [2024-11-20 08:23:45,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:45,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587893559] [2024-11-20 08:23:45,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:45,318 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-20 08:23:45,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:45,321 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-20 08:23:45,321 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-20 08:23:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:45,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 08:23:45,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:23:45,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:23:45,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587893559] [2024-11-20 08:23:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587893559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:23:45,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:23:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:23:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105638166] [2024-11-20 08:23:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:45,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:23:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:45,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:23:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:23:45,610 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:45,695 INFO L93 Difference]: Finished difference Result 184 states and 257 transitions. [2024-11-20 08:23:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:23:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-20 08:23:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:45,696 INFO L225 Difference]: With dead ends: 184 [2024-11-20 08:23:45,697 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 08:23:45,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:23:45,698 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:45,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:23:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 08:23:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-11-20 08:23:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 08:23:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2024-11-20 08:23:45,703 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 73 [2024-11-20 08:23:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2024-11-20 08:23:45,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-11-20 08:23:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:45,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:45,705 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:45,718 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-20 08:23:45,905 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-20 08:23:45,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:45,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash 674703558, now seen corresponding path program 1 times [2024-11-20 08:23:45,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:45,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395403156] [2024-11-20 08:23:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:45,907 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-20 08:23:45,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:45,909 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-20 08:23:45,910 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-20 08:23:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:46,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 08:23:46,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:46,726 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 131 treesize of output 67 [2024-11-20 08:23:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 08:23:46,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:23:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:23:47,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:47,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395403156] [2024-11-20 08:23:47,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395403156] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:23:47,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:23:47,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-20 08:23:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30845372] [2024-11-20 08:23:47,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:47,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:23:47,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:47,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:23:47,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:23:47,123 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:47,610 INFO L93 Difference]: Finished difference Result 260 states and 359 transitions. [2024-11-20 08:23:47,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:23:47,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-20 08:23:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:47,614 INFO L225 Difference]: With dead ends: 260 [2024-11-20 08:23:47,614 INFO L226 Difference]: Without dead ends: 169 [2024-11-20 08:23:47,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:23:47,615 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 86 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:47,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 399 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:23:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-20 08:23:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-20 08:23:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.37012987012987) internal successors, (211), 155 states have internal predecessors, (211), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:23:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 229 transitions. [2024-11-20 08:23:47,633 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 229 transitions. Word has length 73 [2024-11-20 08:23:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:47,633 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 229 transitions. [2024-11-20 08:23:47,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 229 transitions. [2024-11-20 08:23:47,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:47,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:47,637 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:47,646 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 (6)] Forceful destruction successful, exit code 0 [2024-11-20 08:23:47,837 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-20 08:23:47,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:47,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash -913644344, now seen corresponding path program 1 times [2024-11-20 08:23:47,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:47,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510730457] [2024-11-20 08:23:47,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:47,839 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-20 08:23:47,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:47,842 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-20 08:23:47,843 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-20 08:23:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:48,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:23:48,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:48,182 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-20 08:23:48,540 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 131 treesize of output 67 [2024-11-20 08:23:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 08:23:48,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:23:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:23:49,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:49,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510730457] [2024-11-20 08:23:49,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510730457] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:23:49,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:23:49,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-11-20 08:23:49,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384374697] [2024-11-20 08:23:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:23:49,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:23:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:49,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:23:49,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:23:49,021 INFO L87 Difference]: Start difference. First operand 166 states and 229 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:23:49,640 INFO L93 Difference]: Finished difference Result 423 states and 580 transitions. [2024-11-20 08:23:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:23:49,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-20 08:23:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:23:49,644 INFO L225 Difference]: With dead ends: 423 [2024-11-20 08:23:49,644 INFO L226 Difference]: Without dead ends: 254 [2024-11-20 08:23:49,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:23:49,645 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 114 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 08:23:49,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 430 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 08:23:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-20 08:23:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 166. [2024-11-20 08:23:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 155 states have internal predecessors, (210), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:23:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2024-11-20 08:23:49,658 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 73 [2024-11-20 08:23:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:23:49,659 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2024-11-20 08:23:49,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:23:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2024-11-20 08:23:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:23:49,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:23:49,662 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:23:49,671 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-20 08:23:49,862 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-20 08:23:49,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:23:49,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:23:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash -490942518, now seen corresponding path program 1 times [2024-11-20 08:23:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:23:49,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454127825] [2024-11-20 08:23:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:49,863 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-20 08:23:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:23:49,864 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-20 08:23:49,865 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-20 08:23:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:50,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 08:23:50,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:50,510 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 131 treesize of output 67 [2024-11-20 08:23:50,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:23:50,633 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 166 treesize of output 58 [2024-11-20 08:23:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 08:23:50,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:23:50,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:23:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454127825] [2024-11-20 08:23:50,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454127825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:23:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2078623977] [2024-11-20 08:23:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:23:50,937 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:23:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:23:50,939 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:23:50,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-20 08:23:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:23:51,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 08:23:51,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:23:51,761 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 101 treesize of output 55 [2024-11-20 08:23:51,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:23:51,885 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 136 treesize of output 46 [2024-11-20 08:23:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 08:23:51,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:23:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2078623977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:23:52,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:23:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-11-20 08:23:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384266981] [2024-11-20 08:23:52,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:23:52,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 08:23:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:23:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 08:23:52,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:23:52,077 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-20 08:23:54,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:56,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:23:59,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:01,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:02,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:05,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:07,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:08,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:10,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:12,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:14,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:15,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:17,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:24:18,279 INFO L93 Difference]: Finished difference Result 558 states and 765 transitions. [2024-11-20 08:24:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 08:24:18,282 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2024-11-20 08:24:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:24:18,284 INFO L225 Difference]: With dead ends: 558 [2024-11-20 08:24:18,284 INFO L226 Difference]: Without dead ends: 395 [2024-11-20 08:24:18,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2024-11-20 08:24:18,285 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 501 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2024-11-20 08:24:18,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 885 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 25.9s Time] [2024-11-20 08:24:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-20 08:24:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 259. [2024-11-20 08:24:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 240 states have (on average 1.3666666666666667) internal successors, (328), 242 states have internal predecessors, (328), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 08:24:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 358 transitions. [2024-11-20 08:24:18,304 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 358 transitions. Word has length 73 [2024-11-20 08:24:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:24:18,305 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 358 transitions. [2024-11-20 08:24:18,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-20 08:24:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 358 transitions. [2024-11-20 08:24:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 08:24:18,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:24:18,307 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:24:18,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-20 08:24:18,517 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 (8)] Forceful destruction successful, exit code 0 [2024-11-20 08:24:18,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-20 08:24:18,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:24:18,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:24:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash -844030900, now seen corresponding path program 1 times [2024-11-20 08:24:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:24:18,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931328435] [2024-11-20 08:24:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:18,708 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-20 08:24:18,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:24:18,709 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-20 08:24:18,716 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-20 08:24:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:18,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 08:24:18,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 08:24:18,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:24:18,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:18,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931328435] [2024-11-20 08:24:18,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931328435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:24:18,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:24:18,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:24:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709500748] [2024-11-20 08:24:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:24:18,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:24:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:18,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:24:18,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:24:18,950 INFO L87 Difference]: Start difference. First operand 259 states and 358 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:24:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:24:18,981 INFO L93 Difference]: Finished difference Result 515 states and 713 transitions. [2024-11-20 08:24:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:24:18,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-20 08:24:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:24:18,983 INFO L225 Difference]: With dead ends: 515 [2024-11-20 08:24:18,983 INFO L226 Difference]: Without dead ends: 259 [2024-11-20 08:24:18,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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-20 08:24:18,984 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:24:18,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:24:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-20 08:24:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-20 08:24:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 240 states have (on average 1.3625) internal successors, (327), 242 states have internal predecessors, (327), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 08:24:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 357 transitions. [2024-11-20 08:24:18,993 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 357 transitions. Word has length 73 [2024-11-20 08:24:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:24:18,994 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 357 transitions. [2024-11-20 08:24:18,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 08:24:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 357 transitions. [2024-11-20 08:24:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 08:24:18,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:24:18,995 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:24:19,004 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-20 08:24:19,196 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-20 08:24:19,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:24:19,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:24:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2036446323, now seen corresponding path program 1 times [2024-11-20 08:24:19,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:24:19,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118238043] [2024-11-20 08:24:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:19,197 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-20 08:24:19,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:24:19,198 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-20 08:24:19,199 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-20 08:24:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:19,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 08:24:19,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:19,534 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-20 08:24:19,805 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 131 treesize of output 67 [2024-11-20 08:24:20,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:24:20,171 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 224 treesize of output 80 [2024-11-20 08:24:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 08:24:20,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:24:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:24:21,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:21,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118238043] [2024-11-20 08:24:21,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118238043] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:24:21,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:24:21,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-11-20 08:24:21,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660631632] [2024-11-20 08:24:21,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:24:21,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:24:21,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:21,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:24:21,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-11-20 08:24:21,045 INFO L87 Difference]: Start difference. First operand 259 states and 357 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:24:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:24:23,152 INFO L93 Difference]: Finished difference Result 670 states and 915 transitions. [2024-11-20 08:24:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:24:23,153 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2024-11-20 08:24:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:24:23,155 INFO L225 Difference]: With dead ends: 670 [2024-11-20 08:24:23,155 INFO L226 Difference]: Without dead ends: 414 [2024-11-20 08:24:23,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-11-20 08:24:23,156 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 408 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 08:24:23,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 888 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 08:24:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-20 08:24:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 269. [2024-11-20 08:24:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 250 states have (on average 1.364) internal successors, (341), 252 states have internal predecessors, (341), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 08:24:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 371 transitions. [2024-11-20 08:24:23,166 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 371 transitions. Word has length 74 [2024-11-20 08:24:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:24:23,167 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 371 transitions. [2024-11-20 08:24:23,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:24:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 371 transitions. [2024-11-20 08:24:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 08:24:23,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:24:23,168 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:24:23,177 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 (11)] Ended with exit code 0 [2024-11-20 08:24:23,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:24:23,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:24:23,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:24:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash -279510336, now seen corresponding path program 1 times [2024-11-20 08:24:23,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:24:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315693950] [2024-11-20 08:24:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:23,370 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-20 08:24:23,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:24:23,371 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:24:23,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 08:24:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:23,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:24:23,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:23,931 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 35 treesize of output 17 [2024-11-20 08:24:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 08:24:23,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:24:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-20 08:24:24,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:24,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315693950] [2024-11-20 08:24:24,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315693950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:24:24,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:24:24,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-11-20 08:24:24,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869274398] [2024-11-20 08:24:24,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:24:24,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 08:24:24,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:24,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 08:24:24,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:24:24,344 INFO L87 Difference]: Start difference. First operand 269 states and 371 transitions. Second operand has 16 states, 12 states have (on average 6.166666666666667) internal successors, (74), 16 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-20 08:24:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:24:24,696 INFO L93 Difference]: Finished difference Result 401 states and 538 transitions. [2024-11-20 08:24:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 08:24:24,697 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 6.166666666666667) internal successors, (74), 16 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2024-11-20 08:24:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:24:24,698 INFO L225 Difference]: With dead ends: 401 [2024-11-20 08:24:24,699 INFO L226 Difference]: Without dead ends: 135 [2024-11-20 08:24:24,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-20 08:24:24,699 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 84 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:24:24,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 692 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:24:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-20 08:24:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2024-11-20 08:24:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 116 states have internal predecessors, (146), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:24:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2024-11-20 08:24:24,709 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 74 [2024-11-20 08:24:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:24:24,709 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2024-11-20 08:24:24,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 6.166666666666667) internal successors, (74), 16 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-20 08:24:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2024-11-20 08:24:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 08:24:24,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:24:24,710 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:24:24,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-20 08:24:24,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:24:24,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:24:24,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:24:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash 109203088, now seen corresponding path program 1 times [2024-11-20 08:24:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:24:24,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178826687] [2024-11-20 08:24:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:24,912 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-20 08:24:24,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:24:24,914 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-20 08:24:24,915 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-20 08:24:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:25,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 08:24:25,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:25,553 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 129 treesize of output 65 [2024-11-20 08:24:25,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:24:25,682 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 164 treesize of output 56 [2024-11-20 08:24:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 08:24:25,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:24:25,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:25,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178826687] [2024-11-20 08:24:25,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178826687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:24:25,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [199866551] [2024-11-20 08:24:25,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:25,934 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:24:25,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:24:25,935 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:24:25,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-20 08:24:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:26,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 08:24:26,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:26,950 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 100 treesize of output 54 [2024-11-20 08:24:27,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:24:27,082 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 135 treesize of output 45 [2024-11-20 08:24:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 08:24:27,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:24:27,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [199866551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:24:27,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:24:27,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2024-11-20 08:24:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689398957] [2024-11-20 08:24:27,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:24:27,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 08:24:27,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 08:24:27,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-11-20 08:24:27,257 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand has 21 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-20 08:24:31,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:33,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:35,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:37,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:40,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:42,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:44,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:24:45,287 INFO L93 Difference]: Finished difference Result 394 states and 487 transitions. [2024-11-20 08:24:45,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 08:24:45,288 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 75 [2024-11-20 08:24:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:24:45,289 INFO L225 Difference]: With dead ends: 394 [2024-11-20 08:24:45,289 INFO L226 Difference]: Without dead ends: 266 [2024-11-20 08:24:45,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=296, Invalid=1510, Unknown=0, NotChecked=0, Total=1806 [2024-11-20 08:24:45,290 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 397 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:24:45,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 992 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2024-11-20 08:24:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-20 08:24:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 145. [2024-11-20 08:24:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.24) internal successors, (155), 126 states have internal predecessors, (155), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 08:24:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 179 transitions. [2024-11-20 08:24:45,297 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 179 transitions. Word has length 75 [2024-11-20 08:24:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:24:45,297 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 179 transitions. [2024-11-20 08:24:45,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-20 08:24:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2024-11-20 08:24:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 08:24:45,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:24:45,298 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:24:45,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-20 08:24:45,508 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-20 08:24:45,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-20 08:24:45,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:24:45,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:24:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2037475790, now seen corresponding path program 1 times [2024-11-20 08:24:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:24:45,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703742644] [2024-11-20 08:24:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:45,699 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-20 08:24:45,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:24:45,700 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-20 08:24:45,702 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-20 08:24:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:45,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:24:45,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 08:24:45,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:24:45,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:45,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703742644] [2024-11-20 08:24:45,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703742644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:24:45,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:24:45,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:24:45,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697063240] [2024-11-20 08:24:45,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:24:45,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:24:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:24:45,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:24:45,970 INFO L87 Difference]: Start difference. First operand 145 states and 179 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 08:24:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:24:46,091 INFO L93 Difference]: Finished difference Result 272 states and 334 transitions. [2024-11-20 08:24:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:24:46,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2024-11-20 08:24:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:24:46,093 INFO L225 Difference]: With dead ends: 272 [2024-11-20 08:24:46,093 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 08:24:46,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 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-20 08:24:46,094 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:24:46,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 494 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:24:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 08:24:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2024-11-20 08:24:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 105 states have internal predecessors, (129), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:24:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2024-11-20 08:24:46,101 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 75 [2024-11-20 08:24:46,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:24:46,102 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2024-11-20 08:24:46,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-20 08:24:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2024-11-20 08:24:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-20 08:24:46,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:24:46,102 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:24:46,112 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-20 08:24:46,303 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-20 08:24:46,303 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:24:46,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:24:46,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1419648453, now seen corresponding path program 1 times [2024-11-20 08:24:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:24:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455783122] [2024-11-20 08:24:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:46,304 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-20 08:24:46,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:24:46,305 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-20 08:24:46,307 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-20 08:24:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:46,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 08:24:46,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:46,645 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 22 treesize of output 18 [2024-11-20 08:24:46,716 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 69 treesize of output 51 [2024-11-20 08:24:46,721 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 51 treesize of output 33 [2024-11-20 08:24:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 08:24:46,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:24:46,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455783122] [2024-11-20 08:24:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455783122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:24:46,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:24:46,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:24:46,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954517708] [2024-11-20 08:24:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:24:46,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:24:46,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:46,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:24:46,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:24:46,766 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:24:48,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:51,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:55,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:57,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 08:24:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:24:57,974 INFO L93 Difference]: Finished difference Result 352 states and 432 transitions. [2024-11-20 08:24:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:24:57,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 76 [2024-11-20 08:24:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:24:57,976 INFO L225 Difference]: With dead ends: 352 [2024-11-20 08:24:57,976 INFO L226 Difference]: Without dead ends: 235 [2024-11-20 08:24:57,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:24:57,977 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 89 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:24:57,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 602 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2024-11-20 08:24:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-20 08:24:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 142. [2024-11-20 08:24:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 126 states have (on average 1.253968253968254) internal successors, (158), 127 states have internal predecessors, (158), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:24:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2024-11-20 08:24:57,986 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 76 [2024-11-20 08:24:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:24:57,986 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2024-11-20 08:24:57,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 08:24:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2024-11-20 08:24:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-20 08:24:57,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:24:57,987 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:24:58,000 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-20 08:24:58,187 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-20 08:24:58,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:24:58,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:24:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1332251575, now seen corresponding path program 1 times [2024-11-20 08:24:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:24:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495972802] [2024-11-20 08:24:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:24:58,189 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-20 08:24:58,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:24:58,190 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-20 08:24:58,191 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-20 08:24:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:24:58,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:24:58,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:24:58,801 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 42 treesize of output 29 [2024-11-20 08:24:58,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:24:58,943 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 46 treesize of output 20 [2024-11-20 08:24:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-20 08:24:58,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:24:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-20 08:24:59,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:24:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495972802] [2024-11-20 08:24:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495972802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:24:59,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:24:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-20 08:24:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074843561] [2024-11-20 08:24:59,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:24:59,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 08:24:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:24:59,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 08:24:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-20 08:24:59,348 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 18 states, 14 states have (on average 6.214285714285714) internal successors, (87), 18 states have internal predecessors, (87), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-20 08:25:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:25:00,035 INFO L93 Difference]: Finished difference Result 271 states and 333 transitions. [2024-11-20 08:25:00,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 08:25:00,036 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 6.214285714285714) internal successors, (87), 18 states have internal predecessors, (87), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 76 [2024-11-20 08:25:00,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:25:00,037 INFO L225 Difference]: With dead ends: 271 [2024-11-20 08:25:00,037 INFO L226 Difference]: Without dead ends: 132 [2024-11-20 08:25:00,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2024-11-20 08:25:00,038 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 141 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:25:00,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 548 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:25:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-20 08:25:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2024-11-20 08:25:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 113 states have internal predecessors, (136), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 08:25:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2024-11-20 08:25:00,046 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 76 [2024-11-20 08:25:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:25:00,046 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2024-11-20 08:25:00,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 6.214285714285714) internal successors, (87), 18 states have internal predecessors, (87), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-20 08:25:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2024-11-20 08:25:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 08:25:00,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:25:00,047 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 08:25:00,058 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-20 08:25:00,247 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-20 08:25:00,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:25:00,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:25:00,248 INFO L85 PathProgramCache]: Analyzing trace with hash -436368726, now seen corresponding path program 1 times [2024-11-20 08:25:00,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:25:00,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036760964] [2024-11-20 08:25:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:25:00,248 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-20 08:25:00,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:25:00,250 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-20 08:25:00,250 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-20 08:25:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:25:01,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 08:25:01,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:25:02,488 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 131 treesize of output 67