./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.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 d21eae51382172bbf3691ffadae96585570ced8d483d005b36cf63c81911236b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:52:59,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:52:59,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:52:59,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:52:59,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:52:59,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:52:59,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:52:59,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:52:59,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:52:59,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:52:59,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:52:59,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:52:59,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:52:59,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:52:59,193 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:52:59,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:52:59,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:52:59,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:52:59,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:52:59,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:52:59,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:52:59,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:52:59,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:52:59,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:52:59,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:52:59,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:52:59,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:52:59,200 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:52:59,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:52:59,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:52:59,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:52:59,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:52:59,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:52:59,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:52:59,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:52:59,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:52:59,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:52:59,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:52:59,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:52:59,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:52:59,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:52:59,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:52:59,205 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 -> d21eae51382172bbf3691ffadae96585570ced8d483d005b36cf63c81911236b [2024-11-10 09:52:59,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:52:59,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:52:59,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:52:59,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:52:59,480 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:52:59,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i [2024-11-10 09:53:01,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:53:01,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:53:01,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i [2024-11-10 09:53:01,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842674617/a304e72dce7b4dc4b48f261be731f92a/FLAG16eaef4cc [2024-11-10 09:53:01,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842674617/a304e72dce7b4dc4b48f261be731f92a [2024-11-10 09:53:01,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:53:01,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:53:01,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:53:01,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:53:01,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:53:01,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722d44df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01, skipping insertion in model container [2024-11-10 09:53:01,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:53:01,456 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-s_file-92.i[916,929] [2024-11-10 09:53:01,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:53:01,555 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:53:01,572 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-s_file-92.i[916,929] [2024-11-10 09:53:01,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:53:01,652 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:53:01,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01 WrapperNode [2024-11-10 09:53:01,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:53:01,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:53:01,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:53:01,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:53:01,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,740 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2024-11-10 09:53:01,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:53:01,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:53:01,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:53:01,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:53:01,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,774 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 09:53:01,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,800 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:53:01,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:53:01,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:53:01,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:53:01,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (1/1) ... [2024-11-10 09:53:01,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:53:01,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:01,875 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-10 09:53:01,880 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-10 09:53:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:53:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 09:53:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 09:53:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 09:53:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 09:53:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 09:53:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 09:53:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:53:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:53:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 09:53:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:53:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:53:02,051 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:53:02,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:53:02,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~mem86#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~bitwise90#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~short97#1;havoc property_#t~mem102#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~short111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite120#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2024-11-10 09:53:02,691 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-10 09:53:02,691 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:53:02,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:53:02,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:53:02,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:53:02 BoogieIcfgContainer [2024-11-10 09:53:02,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:53:02,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:53:02,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:53:02,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:53:02,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:53:01" (1/3) ... [2024-11-10 09:53:02,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52524e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:53:02, skipping insertion in model container [2024-11-10 09:53:02,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:01" (2/3) ... [2024-11-10 09:53:02,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52524e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:53:02, skipping insertion in model container [2024-11-10 09:53:02,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:53:02" (3/3) ... [2024-11-10 09:53:02,728 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-92.i [2024-11-10 09:53:02,745 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:53:02,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:53:02,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:53:02,805 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;@1b40d0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:53:02,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:53:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 95 states have internal predecessors, (128), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:53:02,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:02,821 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:02,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:02,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1272331897, now seen corresponding path program 1 times [2024-11-10 09:53:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:02,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33367742] [2024-11-10 09:53:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:53:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:53:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:53:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:53:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:53:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:53:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:53:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:53:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:53:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:53:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:53:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:53:03,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:03,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33367742] [2024-11-10 09:53:03,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33367742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:03,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:03,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:53:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996532687] [2024-11-10 09:53:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:03,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:53:03,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:03,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:53:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:53:03,400 INFO L87 Difference]: Start difference. First operand has 116 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 95 states have internal predecessors, (128), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:53:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:03,437 INFO L93 Difference]: Finished difference Result 224 states and 344 transitions. [2024-11-10 09:53:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:53:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-10 09:53:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:03,449 INFO L225 Difference]: With dead ends: 224 [2024-11-10 09:53:03,450 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 09:53:03,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-10 09:53:03,457 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:03,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:53:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 09:53:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-10 09:53:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-10 09:53:03,500 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 155 [2024-11-10 09:53:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:03,500 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-10 09:53:03,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:53:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-10 09:53:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:53:03,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:03,504 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:03,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:53:03,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:03,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1591386680, now seen corresponding path program 1 times [2024-11-10 09:53:03,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:03,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613674249] [2024-11-10 09:53:03,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:03,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:05,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:53:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:05,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:53:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:05,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:53:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:05,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:05,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:05,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:53:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:53:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:53:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:53:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:53:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:53:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:53:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:53:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 09:53:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613674249] [2024-11-10 09:53:06,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613674249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:53:06,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556604130] [2024-11-10 09:53:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:06,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:06,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:06,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:53:06,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:53:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:06,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 09:53:06,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:53:06,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:53:06,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:06,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-10 09:53:06,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:06,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-10 09:53:06,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:06,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-10 09:53:06,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:06,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-10 09:53:07,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:07,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-10 09:53:07,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:07,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 40 [2024-11-10 09:53:07,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:07,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 16 [2024-11-10 09:53:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 374 proven. 63 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-11-10 09:53:07,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:53:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-10 09:53:11,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556604130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:53:11,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:53:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 30 [2024-11-10 09:53:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083792181] [2024-11-10 09:53:11,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:53:11,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 09:53:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:11,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 09:53:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2024-11-10 09:53:11,034 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 30 states, 25 states have (on average 5.84) internal successors, (146), 30 states have internal predecessors, (146), 11 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (51), 6 states have call predecessors, (51), 11 states have call successors, (51) [2024-11-10 09:53:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:13,828 INFO L93 Difference]: Finished difference Result 305 states and 421 transitions. [2024-11-10 09:53:13,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-10 09:53:13,829 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 5.84) internal successors, (146), 30 states have internal predecessors, (146), 11 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (51), 6 states have call predecessors, (51), 11 states have call successors, (51) Word has length 155 [2024-11-10 09:53:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:13,831 INFO L225 Difference]: With dead ends: 305 [2024-11-10 09:53:13,832 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 09:53:13,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=730, Invalid=2930, Unknown=0, NotChecked=0, Total=3660 [2024-11-10 09:53:13,837 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 910 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:13,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 929 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 09:53:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 09:53:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2024-11-10 09:53:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 162 states have internal predecessors, (212), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 09:53:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 258 transitions. [2024-11-10 09:53:13,869 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 258 transitions. Word has length 155 [2024-11-10 09:53:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:13,871 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 258 transitions. [2024-11-10 09:53:13,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 5.84) internal successors, (146), 30 states have internal predecessors, (146), 11 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (51), 6 states have call predecessors, (51), 11 states have call successors, (51) [2024-11-10 09:53:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 258 transitions. [2024-11-10 09:53:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:53:13,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:13,875 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:13,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:53:14,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:14,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:14,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash -513676362, now seen corresponding path program 1 times [2024-11-10 09:53:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291358055] [2024-11-10 09:53:14,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:53:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:53:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:53:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:53:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:53:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:53:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:53:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:53:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:53:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:53:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:53:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:53:18,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:18,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291358055] [2024-11-10 09:53:18,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291358055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:18,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:18,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:53:18,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771228823] [2024-11-10 09:53:18,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:18,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:53:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:18,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:53:18,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:53:18,074 INFO L87 Difference]: Start difference. First operand 191 states and 258 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:19,168 INFO L93 Difference]: Finished difference Result 384 states and 518 transitions. [2024-11-10 09:53:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:53:19,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-10 09:53:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:19,174 INFO L225 Difference]: With dead ends: 384 [2024-11-10 09:53:19,175 INFO L226 Difference]: Without dead ends: 196 [2024-11-10 09:53:19,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:53:19,177 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 63 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:19,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 732 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 09:53:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-10 09:53:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-10 09:53:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 163 states have (on average 1.312883435582822) internal successors, (214), 164 states have internal predecessors, (214), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 09:53:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 260 transitions. [2024-11-10 09:53:19,205 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 260 transitions. Word has length 155 [2024-11-10 09:53:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:19,207 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 260 transitions. [2024-11-10 09:53:19,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 260 transitions. [2024-11-10 09:53:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:53:19,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:19,212 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:19,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:53:19,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:19,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1024210539, now seen corresponding path program 1 times [2024-11-10 09:53:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297086698] [2024-11-10 09:53:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:53:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:53:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:53:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:53:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:53:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:53:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:53:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:53:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:53:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:53:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:53:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:53:21,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:21,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297086698] [2024-11-10 09:53:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297086698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:21,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:21,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:53:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61881719] [2024-11-10 09:53:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:21,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:53:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:21,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:53:21,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:53:21,083 INFO L87 Difference]: Start difference. First operand 193 states and 260 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:53:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:21,750 INFO L93 Difference]: Finished difference Result 385 states and 517 transitions. [2024-11-10 09:53:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:53:21,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-10 09:53:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:21,753 INFO L225 Difference]: With dead ends: 385 [2024-11-10 09:53:21,754 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 09:53:21,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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-10 09:53:21,756 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 72 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:21,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 660 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:53:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 09:53:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2024-11-10 09:53:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 161 states have (on average 1.3043478260869565) internal successors, (210), 162 states have internal predecessors, (210), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 09:53:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 256 transitions. [2024-11-10 09:53:21,782 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 256 transitions. Word has length 155 [2024-11-10 09:53:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:21,786 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 256 transitions. [2024-11-10 09:53:21,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:53:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 256 transitions. [2024-11-10 09:53:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:53:21,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:21,788 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:21,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:53:21,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:21,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:21,790 INFO L85 PathProgramCache]: Analyzing trace with hash -701406154, now seen corresponding path program 1 times [2024-11-10 09:53:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:21,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456941826] [2024-11-10 09:53:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:21,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:53:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:53:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:53:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:53:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:53:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:53:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:53:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:53:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:53:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:53:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:53:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:53:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:23,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456941826] [2024-11-10 09:53:23,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456941826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:23,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:23,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:53:23,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164349202] [2024-11-10 09:53:23,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:23,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:53:23,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:23,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:53:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:53:23,604 INFO L87 Difference]: Start difference. First operand 191 states and 256 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:24,018 INFO L93 Difference]: Finished difference Result 387 states and 515 transitions. [2024-11-10 09:53:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:53:24,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-10 09:53:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:24,021 INFO L225 Difference]: With dead ends: 387 [2024-11-10 09:53:24,021 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 09:53:24,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:53:24,023 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 75 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:24,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 480 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:53:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 09:53:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 149. [2024-11-10 09:53:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 197 transitions. [2024-11-10 09:53:24,035 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 197 transitions. Word has length 155 [2024-11-10 09:53:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:24,036 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 197 transitions. [2024-11-10 09:53:24,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 197 transitions. [2024-11-10 09:53:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 09:53:24,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:24,038 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:24,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:53:24,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:24,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:24,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1211940331, now seen corresponding path program 1 times [2024-11-10 09:53:24,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:24,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645120666] [2024-11-10 09:53:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:24,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:53:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:53:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:53:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:53:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:53:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:53:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:53:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:53:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:53:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:53:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:53:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:53:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:27,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645120666] [2024-11-10 09:53:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645120666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:27,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:53:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115084413] [2024-11-10 09:53:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:27,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:53:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:27,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:53:27,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:53:27,303 INFO L87 Difference]: Start difference. First operand 149 states and 197 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:53:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:28,629 INFO L93 Difference]: Finished difference Result 329 states and 437 transitions. [2024-11-10 09:53:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:53:28,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-10 09:53:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:28,632 INFO L225 Difference]: With dead ends: 329 [2024-11-10 09:53:28,632 INFO L226 Difference]: Without dead ends: 183 [2024-11-10 09:53:28,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:53:28,634 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 59 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:28,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1133 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 09:53:28,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-10 09:53:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 147. [2024-11-10 09:53:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.278688524590164) internal successors, (156), 122 states have internal predecessors, (156), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 194 transitions. [2024-11-10 09:53:28,650 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 194 transitions. Word has length 155 [2024-11-10 09:53:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:28,651 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 194 transitions. [2024-11-10 09:53:28,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:53:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 194 transitions. [2024-11-10 09:53:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 09:53:28,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:28,654 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:28,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:53:28,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:28,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:28,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1074385031, now seen corresponding path program 1 times [2024-11-10 09:53:28,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:28,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792447857] [2024-11-10 09:53:28,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:28,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:53:28,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231101603] [2024-11-10 09:53:28,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:28,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:28,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:28,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:53:28,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 09:53:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:29,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 09:53:29,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:53:29,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:53:29,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:53:29,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:53:29,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:53:29,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-10 09:53:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:53:29,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:53:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:29,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792447857] [2024-11-10 09:53:29,116 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:53:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231101603] [2024-11-10 09:53:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231101603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:29,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:53:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608283330] [2024-11-10 09:53:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:29,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:53:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:53:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:53:29,118 INFO L87 Difference]: Start difference. First operand 147 states and 194 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:29,570 INFO L93 Difference]: Finished difference Result 371 states and 489 transitions. [2024-11-10 09:53:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:53:29,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 159 [2024-11-10 09:53:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:29,572 INFO L225 Difference]: With dead ends: 371 [2024-11-10 09:53:29,572 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 09:53:29,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:53:29,574 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 67 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:29,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 625 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:53:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 09:53:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 178. [2024-11-10 09:53:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 153 states have (on average 1.2875816993464053) internal successors, (197), 153 states have internal predecessors, (197), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 235 transitions. [2024-11-10 09:53:29,586 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 235 transitions. Word has length 159 [2024-11-10 09:53:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:29,586 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 235 transitions. [2024-11-10 09:53:29,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 235 transitions. [2024-11-10 09:53:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 09:53:29,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:29,588 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:29,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 09:53:29,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 09:53:29,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:29,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:29,789 INFO L85 PathProgramCache]: Analyzing trace with hash 433166778, now seen corresponding path program 1 times [2024-11-10 09:53:29,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:29,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552937785] [2024-11-10 09:53:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:29,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:53:29,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109157032] [2024-11-10 09:53:29,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:29,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:29,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:29,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:53:29,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 09:53:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:30,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 09:53:30,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:53:30,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:53:30,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:53:30,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 09:53:30,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:30,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-10 09:53:30,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:30,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-10 09:53:30,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:30,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2024-11-10 09:53:30,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:30,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-10 09:53:30,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-10 09:53:30,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:30,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 43 [2024-11-10 09:53:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-10 09:53:30,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:53:31,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:31,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552937785] [2024-11-10 09:53:31,602 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:53:31,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109157032] [2024-11-10 09:53:31,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109157032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:53:31,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:53:31,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-10 09:53:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194111293] [2024-11-10 09:53:31,603 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 09:53:31,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:53:31,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:31,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:53:31,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=227, Unknown=4, NotChecked=0, Total=306 [2024-11-10 09:53:31,606 INFO L87 Difference]: Start difference. First operand 178 states and 235 transitions. Second operand has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 5 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-10 09:53:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:32,424 INFO L93 Difference]: Finished difference Result 365 states and 477 transitions. [2024-11-10 09:53:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 09:53:32,425 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 5 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 159 [2024-11-10 09:53:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:32,428 INFO L225 Difference]: With dead ends: 365 [2024-11-10 09:53:32,428 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 09:53:32,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=404, Unknown=4, NotChecked=0, Total=552 [2024-11-10 09:53:32,430 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 156 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:32,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 351 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:53:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 09:53:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2024-11-10 09:53:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 159 states have (on average 1.251572327044025) internal successors, (199), 159 states have internal predecessors, (199), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 237 transitions. [2024-11-10 09:53:32,442 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 237 transitions. Word has length 159 [2024-11-10 09:53:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:32,443 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 237 transitions. [2024-11-10 09:53:32,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 5 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-10 09:53:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 237 transitions. [2024-11-10 09:53:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 09:53:32,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:32,445 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:32,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 09:53:32,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:32,646 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:32,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1129907625, now seen corresponding path program 1 times [2024-11-10 09:53:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:32,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249134446] [2024-11-10 09:53:32,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:32,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:53:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:53:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:53:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:53:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:53:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:53:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:53:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:53:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:53:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:53:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:53:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 09:53:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249134446] [2024-11-10 09:53:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249134446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:53:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765637958] [2024-11-10 09:53:33,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:33,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:33,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:33,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:53:33,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 09:53:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:33,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 09:53:33,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:53:33,740 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-10 09:53:33,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-10 09:53:33,800 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 27 treesize of output 15 [2024-11-10 09:53:33,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-10 09:53:33,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-10 09:53:33,836 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 41 treesize of output 23 [2024-11-10 09:53:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-10 09:53:33,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:53:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 09:53:34,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765637958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:53:34,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 09:53:34,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-11-10 09:53:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742934023] [2024-11-10 09:53:34,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 09:53:34,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 09:53:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:34,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 09:53:34,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:53:34,047 INFO L87 Difference]: Start difference. First operand 186 states and 237 transitions. Second operand has 12 states, 9 states have (on average 11.88888888888889) internal successors, (107), 12 states have internal predecessors, (107), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-10 09:53:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:34,791 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2024-11-10 09:53:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:53:34,793 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 11.88888888888889) internal successors, (107), 12 states have internal predecessors, (107), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) Word has length 161 [2024-11-10 09:53:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:34,794 INFO L225 Difference]: With dead ends: 379 [2024-11-10 09:53:34,795 INFO L226 Difference]: Without dead ends: 196 [2024-11-10 09:53:34,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 355 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2024-11-10 09:53:34,796 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 270 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:34,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 353 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:53:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-10 09:53:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2024-11-10 09:53:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 162 states have (on average 1.2222222222222223) internal successors, (198), 162 states have internal predecessors, (198), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 236 transitions. [2024-11-10 09:53:34,813 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 236 transitions. Word has length 161 [2024-11-10 09:53:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:34,816 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 236 transitions. [2024-11-10 09:53:34,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 11.88888888888889) internal successors, (107), 12 states have internal predecessors, (107), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-10 09:53:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 236 transitions. [2024-11-10 09:53:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 09:53:34,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:34,822 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:34,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 09:53:35,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:35,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:35,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:35,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1087850328, now seen corresponding path program 1 times [2024-11-10 09:53:35,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:35,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277399774] [2024-11-10 09:53:35,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:53:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:53:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:53:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:53:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:53:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:53:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:53:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:53:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:53:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:53:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:53:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:53:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:53:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:53:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:53:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:53:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:53:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:53:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 09:53:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:53:35,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:53:35,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277399774] [2024-11-10 09:53:35,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277399774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:35,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:35,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:53:35,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230676070] [2024-11-10 09:53:35,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:35,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:53:35,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:53:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:53:35,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:53:35,415 INFO L87 Difference]: Start difference. First operand 190 states and 236 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:35,614 INFO L93 Difference]: Finished difference Result 377 states and 469 transitions. [2024-11-10 09:53:35,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:53:35,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-10 09:53:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:35,617 INFO L225 Difference]: With dead ends: 377 [2024-11-10 09:53:35,617 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 09:53:35,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:53:35,618 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 135 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:35,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 275 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:53:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 09:53:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-10 09:53:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 162 states have internal predecessors, (194), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 232 transitions. [2024-11-10 09:53:35,640 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 232 transitions. Word has length 161 [2024-11-10 09:53:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:35,640 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 232 transitions. [2024-11-10 09:53:35,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions. [2024-11-10 09:53:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 09:53:35,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:35,644 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:35,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:53:35,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:35,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1914567162, now seen corresponding path program 1 times [2024-11-10 09:53:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:53:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098456964] [2024-11-10 09:53:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:53:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:53:35,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494799682] [2024-11-10 09:53:35,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:35,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:53:35,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:35,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:53:35,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 09:53:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:53:36,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:53:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:53:37,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:53:37,805 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:53:37,807 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:53:37,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 09:53:38,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 09:53:38,012 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:38,091 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:53:38,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:53:38 BoogieIcfgContainer [2024-11-10 09:53:38,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:53:38,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:53:38,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:53:38,096 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:53:38,096 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:53:02" (3/4) ... [2024-11-10 09:53:38,099 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:53:38,100 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:53:38,100 INFO L158 Benchmark]: Toolchain (without parser) took 36862.90ms. Allocated memory was 180.4MB in the beginning and 975.2MB in the end (delta: 794.8MB). Free memory was 110.9MB in the beginning and 789.5MB in the end (delta: -678.6MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2024-11-10 09:53:38,101 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 180.4MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:53:38,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.70ms. Allocated memory is still 180.4MB. Free memory was 110.7MB in the beginning and 92.6MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 09:53:38,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.98ms. Allocated memory is still 180.4MB. Free memory was 92.6MB in the beginning and 150.4MB in the end (delta: -57.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-10 09:53:38,101 INFO L158 Benchmark]: Boogie Preprocessor took 77.37ms. Allocated memory is still 180.4MB. Free memory was 150.4MB in the beginning and 147.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:53:38,102 INFO L158 Benchmark]: IcfgBuilder took 899.01ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 111.7MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 09:53:38,102 INFO L158 Benchmark]: TraceAbstraction took 35374.58ms. Allocated memory was 180.4MB in the beginning and 975.2MB in the end (delta: 794.8MB). Free memory was 111.7MB in the beginning and 789.5MB in the end (delta: -677.8MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2024-11-10 09:53:38,102 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 975.2MB. Free memory is still 789.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:53:38,103 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.20ms. Allocated memory is still 180.4MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.70ms. Allocated memory is still 180.4MB. Free memory was 110.7MB in the beginning and 92.6MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.98ms. Allocated memory is still 180.4MB. Free memory was 92.6MB in the beginning and 150.4MB in the end (delta: -57.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.37ms. Allocated memory is still 180.4MB. Free memory was 150.4MB in the beginning and 147.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 899.01ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 111.7MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35374.58ms. Allocated memory was 180.4MB in the beginning and 975.2MB in the end (delta: 794.8MB). Free memory was 111.7MB in the beginning and 789.5MB in the end (delta: -677.8MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 975.2MB. Free memory is still 789.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 115. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] FCALL updateLastVariables() [L123] CALL updateVariables() [L82] WrapperStruct00.var_1_2 = __VERIFIER_nondet_char() [L83] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_3 = __VERIFIER_nondet_char() [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L89] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L102] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] RET updateVariables() [L124] CALL step() [L62] EXPR WrapperStruct00.var_1_2 [L62] EXPR WrapperStruct00.var_1_3 [L62] EXPR WrapperStruct00.var_1_4 [L62] EXPR WrapperStruct00.var_1_5 [L62] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L62] EXPR ((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6)) [L62] EXPR WrapperStruct00.var_1_4 [L62] EXPR ((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] WrapperStruct00.var_1_1 = ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))) [L63] EXPR WrapperStruct00.var_1_5 [L63] EXPR WrapperStruct00.var_1_6 [L63] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L63] EXPR WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L63] signed long int stepLocal_0 = (~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3); [L64] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L64] COND FALSE !(stepLocal_0 >= WrapperStruct00.var_1_4) [L67] EXPR WrapperStruct00.var_1_9 [L67] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L69] EXPR ((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2) [L69] EXPR WrapperStruct00.var_1_2 [L69] EXPR ((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1] [L69] WrapperStruct00.var_1_10 = ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2))) [L70] EXPR WrapperStruct00.var_1_6 [L70] EXPR WrapperStruct00.var_1_14 [L70] signed long int stepLocal_1 = WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14; [L71] COND FALSE !(stepLocal_1 < -100) [L74] EXPR WrapperStruct00.var_1_15 [L74] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L74] WrapperStruct00.var_1_13 = (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16) [L76] EXPR WrapperStruct00.var_1_8 [L76] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_8 [L77] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] COND TRUE ! WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_5 [L78] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] EXPR ((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1) [L78] EXPR WrapperStruct00.var_1_6 [L78] EXPR ((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1) VAL [WrapperStruct00={4:0}, isInitial=1] [L78] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)) [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR WrapperStruct00.var_1_1 [L115] EXPR WrapperStruct00.var_1_2 [L115] EXPR WrapperStruct00.var_1_3 [L115] EXPR WrapperStruct00.var_1_4 [L115] EXPR WrapperStruct00.var_1_5 [L115] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR ((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6)) [L115] EXPR WrapperStruct00.var_1_4 [L115] EXPR ((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9))) [L115] EXPR WrapperStruct00.var_1_5 [L115] EXPR WrapperStruct00.var_1_6 [L115] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)) [L115] EXPR WrapperStruct00.var_1_7 [L115] EXPR WrapperStruct00.var_1_9 [L115] EXPR (((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR ((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR ((((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1)) && (((WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14) < -100) ? (WrapperStruct00.var_1_13 == ((unsigned char) (! (! (! WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (((((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1)) && (((WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14) < -100) ? (WrapperStruct00.var_1_13 == ((unsigned char) (! (! (! WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L115-L116] return (((((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1)) && (((WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14) < -100) ? (WrapperStruct00.var_1_13 == ((unsigned char) (! (! (! WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_8)) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.2s, OverallIterations: 11, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1819 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1807 mSDsluCounter, 5694 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4454 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4780 IncrementalHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 1240 mSDtfsCounter, 4780 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1524 GetRequests, 1379 SyntacticMatches, 5 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=3, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 158 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 2530 NumberOfCodeBlocks, 2530 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2188 ConstructedInterpolants, 1 QuantifiedInterpolants, 11621 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2332 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 9336/9576 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-10 09:53:38,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.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 d21eae51382172bbf3691ffadae96585570ced8d483d005b36cf63c81911236b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:53:40,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:53:40,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:53:40,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:53:40,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:53:40,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:53:40,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:53:40,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:53:40,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:53:40,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:53:40,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:53:40,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:53:40,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:53:40,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:53:40,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:53:40,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:53:40,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:53:40,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:53:40,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:53:40,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:53:40,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:53:40,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:53:40,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:53:40,578 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:53:40,578 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:53:40,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:53:40,578 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:53:40,579 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:53:40,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:53:40,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:53:40,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:53:40,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:53:40,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:53:40,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:53:40,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:53:40,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:53:40,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:53:40,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:53:40,581 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:53:40,581 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:53:40,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:53:40,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:53:40,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:53:40,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:53:40,584 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 -> d21eae51382172bbf3691ffadae96585570ced8d483d005b36cf63c81911236b [2024-11-10 09:53:40,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:53:40,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:53:40,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:53:40,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:53:40,953 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:53:40,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i [2024-11-10 09:53:42,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:53:42,902 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:53:42,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i [2024-11-10 09:53:42,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fbc01dd/c6406e91fb4f4fb18679ada5a49f5bcd/FLAGc3c6801de [2024-11-10 09:53:42,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fbc01dd/c6406e91fb4f4fb18679ada5a49f5bcd [2024-11-10 09:53:42,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:53:42,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:53:42,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:53:42,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:53:42,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:53:42,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:53:42" (1/1) ... [2024-11-10 09:53:42,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1aceca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:42, skipping insertion in model container [2024-11-10 09:53:42,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:53:42" (1/1) ... [2024-11-10 09:53:42,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:53:43,186 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-s_file-92.i[916,929] [2024-11-10 09:53:43,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:53:43,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:53:43,291 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-s_file-92.i[916,929] [2024-11-10 09:53:43,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:53:43,360 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:53:43,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43 WrapperNode [2024-11-10 09:53:43,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:53:43,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:53:43,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:53:43,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:53:43,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,432 INFO L138 Inliner]: procedures = 37, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2024-11-10 09:53:43,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:53:43,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:53:43,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:53:43,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:53:43,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,473 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-10 09:53:43,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:53:43,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:53:43,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:53:43,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:53:43,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (1/1) ... [2024-11-10 09:53:43,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:53:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:53:43,559 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-10 09:53:43,569 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-10 09:53:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:53:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:53:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:53:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-10 09:53:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-10 09:53:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:53:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:53:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:53:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-10 09:53:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-10 09:53:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-10 09:53:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-10 09:53:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:53:43,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:53:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-10 09:53:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-10 09:53:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:53:43,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:53:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:53:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:53:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:53:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:53:43,755 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:53:43,758 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:53:44,814 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~mem85#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite84#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1;havoc property_#t~mem100#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem117#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~short116#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1; [2024-11-10 09:53:44,863 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-10 09:53:44,863 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:53:44,880 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:53:44,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:53:44,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:53:44 BoogieIcfgContainer [2024-11-10 09:53:44,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:53:44,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:53:44,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:53:44,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:53:44,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:53:42" (1/3) ... [2024-11-10 09:53:44,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce7d1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:53:44, skipping insertion in model container [2024-11-10 09:53:44,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:53:43" (2/3) ... [2024-11-10 09:53:44,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce7d1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:53:44, skipping insertion in model container [2024-11-10 09:53:44,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:53:44" (3/3) ... [2024-11-10 09:53:44,892 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-92.i [2024-11-10 09:53:44,908 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:53:44,908 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:53:44,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:53:44,983 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;@77130fe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:53:44,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:53:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 87 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 09:53:45,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:45,006 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:45,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:45,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash 591373211, now seen corresponding path program 1 times [2024-11-10 09:53:45,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:53:45,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590201830] [2024-11-10 09:53:45,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:45,025 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-10 09:53:45,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:53:45,027 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-10 09:53:45,049 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-10 09:53:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:45,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:53:45,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:53:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-10 09:53:45,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:53:45,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:53:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590201830] [2024-11-10 09:53:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590201830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:45,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:53:45,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447001139] [2024-11-10 09:53:45,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:45,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:53:45,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:53:45,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:53:45,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:53:45,559 INFO L87 Difference]: Start difference. First operand has 108 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 87 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:53:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:45,588 INFO L93 Difference]: Finished difference Result 208 states and 320 transitions. [2024-11-10 09:53:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:53:45,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-10 09:53:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:45,597 INFO L225 Difference]: With dead ends: 208 [2024-11-10 09:53:45,598 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 09:53:45,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-10 09:53:45,604 INFO L432 NwaCegarLoop]: 146 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, 146 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-10 09:53:45,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:53:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 09:53:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 09:53:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2024-11-10 09:53:45,650 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 153 [2024-11-10 09:53:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:45,650 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2024-11-10 09:53:45,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:53:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2024-11-10 09:53:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 09:53:45,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:45,654 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:45,668 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-10 09:53:45,855 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-10 09:53:45,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:45,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -916259700, now seen corresponding path program 1 times [2024-11-10 09:53:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:53:45,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801285370] [2024-11-10 09:53:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:45,858 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-10 09:53:45,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:53:45,861 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-10 09:53:45,862 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-10 09:53:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:46,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 09:53:46,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:53:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:53:46,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:53:46,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:53:46,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801285370] [2024-11-10 09:53:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801285370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:53:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:53:46,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:53:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866250011] [2024-11-10 09:53:46,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:53:46,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:53:46,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:53:46,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:53:46,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:53:46,403 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:53:46,651 INFO L93 Difference]: Finished difference Result 212 states and 302 transitions. [2024-11-10 09:53:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:53:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-10 09:53:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:53:46,654 INFO L225 Difference]: With dead ends: 212 [2024-11-10 09:53:46,655 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 09:53:46,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 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-10 09:53:46,657 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:53:46,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 801 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:53:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 09:53:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-10 09:53:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:53:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 154 transitions. [2024-11-10 09:53:46,673 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 154 transitions. Word has length 153 [2024-11-10 09:53:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:53:46,675 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 154 transitions. [2024-11-10 09:53:46,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 09:53:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2024-11-10 09:53:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 09:53:46,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:53:46,678 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:53:46,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 09:53:46,878 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-10 09:53:46,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:53:46,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:53:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash -887630549, now seen corresponding path program 1 times [2024-11-10 09:53:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:53:46,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737342915] [2024-11-10 09:53:46,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:53:46,881 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-10 09:53:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:53:46,884 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-10 09:53:46,885 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-10 09:53:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:53:47,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 09:53:47,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:53:47,490 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-10 09:53:47,589 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 26 treesize of output 25 [2024-11-10 09:53:47,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:47,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-11-10 09:53:48,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:48,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-10 09:53:48,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:48,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-11-10 09:53:48,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:48,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 64 [2024-11-10 09:53:51,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:51,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 87 [2024-11-10 09:53:57,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:57,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 103 [2024-11-10 09:53:57,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:57,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 106 [2024-11-10 09:53:58,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:58,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 96 treesize of output 116 [2024-11-10 09:53:59,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:59,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 119 [2024-11-10 09:53:59,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:53:59,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 112 treesize of output 139 [2024-11-10 09:54:02,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:54:02,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 122 treesize of output 50 [2024-11-10 09:54:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 554 proven. 54 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-10 09:54:03,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:54:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 09:54:03,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:54:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737342915] [2024-11-10 09:54:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737342915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:54:03,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:54:03,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 19 [2024-11-10 09:54:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317951610] [2024-11-10 09:54:03,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:54:03,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 09:54:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:54:03,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 09:54:03,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=233, Unknown=4, NotChecked=0, Total=342 [2024-11-10 09:54:03,552 INFO L87 Difference]: Start difference. First operand 111 states and 154 transitions. Second operand has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 19 states have internal predecessors, (122), 10 states have call successors, (38), 9 states have call predecessors, (38), 11 states have return successors, (38), 8 states have call predecessors, (38), 10 states have call successors, (38) [2024-11-10 09:54:07,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]