./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.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 318749465d360586bbf5c93b0a7c91860553b05314b1354647f65a52d19907b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:24:35,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:24:35,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:24:35,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:24:35,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:24:35,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:24:35,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:24:35,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:24:35,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:24:35,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:24:35,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:24:35,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:24:35,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:24:35,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:24:35,874 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:24:35,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:24:35,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:24:35,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:24:35,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:24:35,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:24:35,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:24:35,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:24:35,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:24:35,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:24:35,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:24:35,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:24:35,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:24:35,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:24:35,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:24:35,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:24:35,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:24:35,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:24:35,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:35,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:24:35,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:24:35,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:24:35,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:24:35,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:24:35,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:24:35,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:24:35,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:24:35,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:24:35,890 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 -> 318749465d360586bbf5c93b0a7c91860553b05314b1354647f65a52d19907b5 [2024-10-13 06:24:36,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:24:36,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:24:36,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:24:36,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:24:36,218 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:24:36,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i [2024-10-13 06:24:38,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:24:38,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:24:38,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i [2024-10-13 06:24:38,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbfb79e7/074120d42c9c42419461a90471fc038a/FLAGb6b97be29 [2024-10-13 06:24:38,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fbfb79e7/074120d42c9c42419461a90471fc038a [2024-10-13 06:24:38,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:24:38,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:24:38,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:38,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:24:38,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:24:38,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1984b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38, skipping insertion in model container [2024-10-13 06:24:38,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:24:38,561 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i[915,928] [2024-10-13 06:24:38,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:38,709 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:24:38,722 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i[915,928] [2024-10-13 06:24:38,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:38,804 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:24:38,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38 WrapperNode [2024-10-13 06:24:38,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:38,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:38,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:24:38,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:24:38,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,888 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2024-10-13 06:24:38,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:38,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:24:38,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:24:38,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:24:38,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,939 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2024-10-13 06:24:38,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:38,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:39,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:24:39,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:24:39,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:24:39,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:24:39,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (1/1) ... [2024-10-13 06:24:39,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:39,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:24:39,062 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-10-13 06:24:39,067 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-10-13 06:24:39,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:24:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:24:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:24:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:24:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:24:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:24:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:24:39,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:24:39,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:24:39,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:24:39,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:24:39,124 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:24:39,124 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:24:39,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:24:39,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:24:39,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:24:39,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:24:39,239 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:24:39,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:24:39,866 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-13 06:24:39,869 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:24:39,917 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:24:39,918 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:24:39,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:39 BoogieIcfgContainer [2024-10-13 06:24:39,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:24:39,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:24:39,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:24:39,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:24:39,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:24:38" (1/3) ... [2024-10-13 06:24:39,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daefedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:24:39, skipping insertion in model container [2024-10-13 06:24:39,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:38" (2/3) ... [2024-10-13 06:24:39,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daefedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:24:39, skipping insertion in model container [2024-10-13 06:24:39,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:39" (3/3) ... [2024-10-13 06:24:39,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-1.i [2024-10-13 06:24:39,950 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:24:39,951 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:24:40,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:24:40,027 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;@d5ad356, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:24:40,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:24:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:24:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 06:24:40,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:40,049 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:40,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:40,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1361185143, now seen corresponding path program 1 times [2024-10-13 06:24:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:40,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323023837] [2024-10-13 06:24:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:24:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:24:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:24:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:24:40,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:40,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323023837] [2024-10-13 06:24:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323023837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:24:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587903557] [2024-10-13 06:24:40,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:40,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:24:40,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:24:40,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:24:40,641 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:24:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:40,702 INFO L93 Difference]: Finished difference Result 199 states and 314 transitions. [2024-10-13 06:24:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:24:40,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-10-13 06:24:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:40,776 INFO L225 Difference]: With dead ends: 199 [2024-10-13 06:24:40,776 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 06:24:40,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:24:40,794 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:40,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:24:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 06:24:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 06:24:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:24:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2024-10-13 06:24:40,857 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 119 [2024-10-13 06:24:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:40,859 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2024-10-13 06:24:40,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:24:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2024-10-13 06:24:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 06:24:40,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:40,865 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:40,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:24:40,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:40,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:40,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1695957089, now seen corresponding path program 1 times [2024-10-13 06:24:40,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:40,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821238797] [2024-10-13 06:24:40,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:24:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:24:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:24:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:24:41,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821238797] [2024-10-13 06:24:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821238797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:41,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:41,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:24:41,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301169669] [2024-10-13 06:24:41,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:41,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:24:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:41,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:24:41,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:41,259 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:41,308 INFO L93 Difference]: Finished difference Result 200 states and 295 transitions. [2024-10-13 06:24:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:24:41,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-10-13 06:24:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:41,311 INFO L225 Difference]: With dead ends: 200 [2024-10-13 06:24:41,311 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 06:24:41,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:41,313 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:41,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 409 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:24:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 06:24:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-10-13 06:24:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:24:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2024-10-13 06:24:41,324 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 119 [2024-10-13 06:24:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:41,326 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2024-10-13 06:24:41,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2024-10-13 06:24:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 06:24:41,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:41,328 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:41,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:24:41,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:41,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:41,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1638698787, now seen corresponding path program 1 times [2024-10-13 06:24:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:41,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345128787] [2024-10-13 06:24:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:24:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:24:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:24:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:24:41,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:41,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345128787] [2024-10-13 06:24:41,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345128787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:41,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:41,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:24:41,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477164289] [2024-10-13 06:24:41,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:41,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:24:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:41,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:24:41,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:41,579 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:41,663 INFO L93 Difference]: Finished difference Result 204 states and 299 transitions. [2024-10-13 06:24:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:24:41,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-10-13 06:24:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:41,670 INFO L225 Difference]: With dead ends: 204 [2024-10-13 06:24:41,670 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 06:24:41,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:41,672 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:41,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 413 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:41,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 06:24:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-13 06:24:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:24:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-10-13 06:24:41,683 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 119 [2024-10-13 06:24:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:41,684 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-10-13 06:24:41,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-10-13 06:24:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 06:24:41,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:41,686 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:41,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:24:41,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:41,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1638639205, now seen corresponding path program 1 times [2024-10-13 06:24:41,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:41,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784386012] [2024-10-13 06:24:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:24:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:24:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:24:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:24:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784386012] [2024-10-13 06:24:42,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784386012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:24:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177510277] [2024-10-13 06:24:42,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:42,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:24:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:42,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:24:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:24:42,973 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:24:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:43,474 INFO L93 Difference]: Finished difference Result 281 states and 408 transitions. [2024-10-13 06:24:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:24:43,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-10-13 06:24:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:43,481 INFO L225 Difference]: With dead ends: 281 [2024-10-13 06:24:43,481 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 06:24:43,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:24:43,483 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 95 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:43,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 571 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:24:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 06:24:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-10-13 06:24:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.4230769230769231) internal successors, (222), 157 states have internal predecessors, (222), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:24:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 256 transitions. [2024-10-13 06:24:43,511 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 256 transitions. Word has length 119 [2024-10-13 06:24:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:43,512 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 256 transitions. [2024-10-13 06:24:43,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:24:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 256 transitions. [2024-10-13 06:24:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 06:24:43,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:43,519 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:43,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:24:43,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:43,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash 850889757, now seen corresponding path program 1 times [2024-10-13 06:24:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:43,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042042914] [2024-10-13 06:24:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:24:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:24:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:24:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:24:44,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:44,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042042914] [2024-10-13 06:24:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042042914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:44,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:44,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:24:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640573248] [2024-10-13 06:24:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:44,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:24:44,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:44,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:24:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:24:44,655 INFO L87 Difference]: Start difference. First operand 176 states and 256 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:24:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:44,997 INFO L93 Difference]: Finished difference Result 427 states and 620 transitions. [2024-10-13 06:24:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:24:44,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-10-13 06:24:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:45,005 INFO L225 Difference]: With dead ends: 427 [2024-10-13 06:24:45,005 INFO L226 Difference]: Without dead ends: 252 [2024-10-13 06:24:45,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:24:45,009 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 172 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:45,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 429 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:24:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-13 06:24:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 191. [2024-10-13 06:24:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.432748538011696) internal successors, (245), 172 states have internal predecessors, (245), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:24:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2024-10-13 06:24:45,037 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 119 [2024-10-13 06:24:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:45,040 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2024-10-13 06:24:45,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:24:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2024-10-13 06:24:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 06:24:45,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:45,042 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:45,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:24:45,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:45,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 264083743, now seen corresponding path program 1 times [2024-10-13 06:24:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:45,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337921992] [2024-10-13 06:24:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:45,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 06:24:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:24:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 06:24:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:24:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 06:24:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337921992] [2024-10-13 06:24:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337921992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846848207] [2024-10-13 06:24:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:24:45,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:24:45,736 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-10-13 06:24:45,747 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-10-13 06:24:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:45,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 06:24:45,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:46,086 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-10-13 06:24:46,149 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-10-13 06:24:46,212 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 25 treesize of output 13 [2024-10-13 06:24:46,224 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-10-13 06:24:46,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:46,248 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 35 [2024-10-13 06:24:46,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:46,318 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-10-13 06:24:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 195 proven. 18 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-13 06:24:46,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 06:24:46,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846848207] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:24:46,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 06:24:46,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2024-10-13 06:24:46,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717961117] [2024-10-13 06:24:46,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 06:24:46,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:24:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:24:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:24:46,626 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-13 06:24:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:47,348 INFO L93 Difference]: Finished difference Result 538 states and 779 transitions. [2024-10-13 06:24:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:24:47,349 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 5 states have call successors, (22) Word has length 119 [2024-10-13 06:24:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:47,353 INFO L225 Difference]: With dead ends: 538 [2024-10-13 06:24:47,354 INFO L226 Difference]: Without dead ends: 348 [2024-10-13 06:24:47,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 259 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:24:47,356 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 244 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:47,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 406 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:24:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-13 06:24:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341. [2024-10-13 06:24:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 308 states have (on average 1.4155844155844155) internal successors, (436), 311 states have internal predecessors, (436), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 06:24:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 490 transitions. [2024-10-13 06:24:47,384 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 490 transitions. Word has length 119 [2024-10-13 06:24:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:47,385 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 490 transitions. [2024-10-13 06:24:47,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-13 06:24:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 490 transitions. [2024-10-13 06:24:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 06:24:47,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:47,388 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:47,408 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-10-13 06:24:47,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 06:24:47,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1324264159, now seen corresponding path program 1 times [2024-10-13 06:24:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192320712] [2024-10-13 06:24:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:24:47,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:24:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:24:47,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:24:47,785 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:24:47,787 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:24:47,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:24:47,791 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:47,850 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:24:47,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:24:47 BoogieIcfgContainer [2024-10-13 06:24:47,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:24:47,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:24:47,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:24:47,854 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:24:47,855 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:39" (3/4) ... [2024-10-13 06:24:47,857 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:24:47,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:24:47,859 INFO L158 Benchmark]: Toolchain (without parser) took 9549.48ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 71.9MB in the beginning and 151.8MB in the end (delta: -80.0MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2024-10-13 06:24:47,859 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:24:47,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.83ms. Allocated memory was 142.6MB in the beginning and 216.0MB in the end (delta: 73.4MB). Free memory was 71.6MB in the beginning and 182.9MB in the end (delta: -111.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-13 06:24:47,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.66ms. Allocated memory is still 216.0MB. Free memory was 182.9MB in the beginning and 179.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:24:47,860 INFO L158 Benchmark]: Boogie Preprocessor took 114.47ms. Allocated memory is still 216.0MB. Free memory was 179.8MB in the beginning and 174.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:24:47,861 INFO L158 Benchmark]: RCFGBuilder took 914.17ms. Allocated memory is still 216.0MB. Free memory was 174.5MB in the beginning and 137.8MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 06:24:47,861 INFO L158 Benchmark]: TraceAbstraction took 7931.43ms. Allocated memory was 216.0MB in the beginning and 348.1MB in the end (delta: 132.1MB). Free memory was 136.8MB in the beginning and 151.8MB in the end (delta: -15.1MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2024-10-13 06:24:47,861 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 348.1MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:24:47,863 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.12ms. Allocated memory is still 142.6MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.83ms. Allocated memory was 142.6MB in the beginning and 216.0MB in the end (delta: 73.4MB). Free memory was 71.6MB in the beginning and 182.9MB in the end (delta: -111.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.66ms. Allocated memory is still 216.0MB. Free memory was 182.9MB in the beginning and 179.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.47ms. Allocated memory is still 216.0MB. Free memory was 179.8MB in the beginning and 174.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 914.17ms. Allocated memory is still 216.0MB. Free memory was 174.5MB in the beginning and 137.8MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7931.43ms. Allocated memory was 216.0MB in the beginning and 348.1MB in the end (delta: 132.1MB). Free memory was 136.8MB in the beginning and 151.8MB in the end (delta: -15.1MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 348.1MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 115. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5.5, 10.375, 127.5, 256.2, 1, 5, 1, 32, 2, 16, 50, 100000000, 2 }; [L53] unsigned long int last_1_WrapperStruct00_var_1_12 = 16; [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] EXPR WrapperStruct00.var_1_12 [L112] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L122] RET updateLastVariables() [L123] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L89] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L89] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L89] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L91] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L91] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L92] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L93] EXPR WrapperStruct00.var_1_4 [L93] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L93] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_4 [L93] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L93] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L93] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L94] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L96] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L97] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L100] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_long() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L108] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L109] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_13 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_13 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L123] RET updateVariables() [L124] CALL step() [L57] EXPR WrapperStruct00.var_1_2 [L57] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L57] COND FALSE !(WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) [L60] WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L60] COND FALSE !(WrapperStruct00.var_1_5) [L63] EXPR WrapperStruct00.var_1_4 [L63] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_4 [L66] EXPR WrapperStruct00.var_1_13 [L66] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_13 [L67] EXPR WrapperStruct00.var_1_7 [L67] unsigned char stepLocal_0 = WrapperStruct00.var_1_7; [L68] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L68] COND FALSE !(WrapperStruct00.var_1_5 || stepLocal_0) [L71] EXPR WrapperStruct00.var_1_10 [L71] EXPR WrapperStruct00.var_1_11 [L71] WrapperStruct00.var_1_6 = ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4) [L73] EXPR WrapperStruct00.var_1_11 [L73] signed long int stepLocal_3 = WrapperStruct00.var_1_11; [L74] EXPR WrapperStruct00.var_1_16 [L74] EXPR WrapperStruct00.var_1_11 [L74] signed long int stepLocal_2 = WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11; [L75] EXPR WrapperStruct00.var_1_11 [L75] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L75] EXPR WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16, stepLocal_2=1, stepLocal_3=0] [L75] signed long int stepLocal_1 = WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16; [L76] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L76] EXPR ((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10) [L76] EXPR WrapperStruct00.var_1_10 [L76] EXPR ((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16, stepLocal_1=0, stepLocal_2=1, stepLocal_3=0] [L76] COND FALSE !(stepLocal_1 != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) [L85] EXPR WrapperStruct00.var_1_16 [L85] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR WrapperStruct00.var_1_2 [L115] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))) [L115] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) [L115] EXPR WrapperStruct00.var_1_1 [L115] EXPR WrapperStruct00.var_1_4 [L115] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR ((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR ((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR ((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR ((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115] EXPR (((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L115-L116] return (((((WrapperStruct00.var_1_2 <= (- WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_4)))) && ((WrapperStruct00.var_1_5 || WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_6 == ((signed long int) ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_6 == ((signed long int) ((WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11) - 4))))) && (((WrapperStruct00.var_1_11 << WrapperStruct00.var_1_16) != ((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10)))) ? (((WrapperStruct00.var_1_16 % WrapperStruct00.var_1_13) >= WrapperStruct00.var_1_11) ? (((WrapperStruct00.var_1_16 + WrapperStruct00.var_1_11) > (last_1_WrapperStruct00_var_1_12 * WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_12 == ((unsigned long int) WrapperStruct00.var_1_10))) : 1) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_13)) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 2369 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1583 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1455 IncrementalHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 786 mSDtfsCounter, 1455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 477 GetRequests, 438 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 73 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 952 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 944 ConstructedInterpolants, 0 QuantifiedInterpolants, 1984 SizeOfPredicates, 4 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2858/2912 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 06:24:47,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.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 318749465d360586bbf5c93b0a7c91860553b05314b1354647f65a52d19907b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:24:50,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:24:50,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:24:50,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:24:50,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:24:50,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:24:50,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:24:50,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:24:50,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:24:50,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:24:50,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:24:50,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:24:50,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:24:50,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:24:50,569 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:24:50,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:24:50,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:24:50,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:24:50,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:24:50,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:24:50,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:24:50,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:24:50,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:24:50,578 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:24:50,578 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:24:50,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:24:50,578 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:24:50,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:24:50,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:24:50,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:24:50,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:24:50,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:24:50,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:24:50,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:24:50,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:50,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:24:50,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:24:50,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:24:50,584 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:24:50,584 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:24:50,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:24:50,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:24:50,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:24:50,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:24:50,585 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:24:50,585 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 -> 318749465d360586bbf5c93b0a7c91860553b05314b1354647f65a52d19907b5 [2024-10-13 06:24:50,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:24:51,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:24:51,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:24:51,020 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:24:51,021 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:24:51,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i [2024-10-13 06:24:52,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:24:53,210 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:24:53,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i [2024-10-13 06:24:53,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec3b149a8/d94b792dc3764e5ab1568da73fb47d78/FLAG48c52c82e [2024-10-13 06:24:53,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec3b149a8/d94b792dc3764e5ab1568da73fb47d78 [2024-10-13 06:24:53,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:24:53,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:24:53,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:53,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:24:53,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:24:53,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:53,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f88e3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53, skipping insertion in model container [2024-10-13 06:24:53,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:53,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:24:53,794 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i[915,928] [2024-10-13 06:24:53,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:53,893 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:24:53,906 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-1.i[915,928] [2024-10-13 06:24:53,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:53,996 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:24:53,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53 WrapperNode [2024-10-13 06:24:53,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:53,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:53,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:24:53,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:24:54,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,098 INFO L138 Inliner]: procedures = 36, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 467 [2024-10-13 06:24:54,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:54,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:24:54,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:24:54,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:24:54,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,166 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2024-10-13 06:24:54,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:24:54,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:24:54,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:24:54,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:24:54,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (1/1) ... [2024-10-13 06:24:54,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:54,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:24:54,288 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-10-13 06:24:54,299 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-10-13 06:24:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:24:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:24:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:24:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:24:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:24:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:24:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:24:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:24:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:24:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:24:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:24:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:24:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:24:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:24:54,351 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:24:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:24:54,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:24:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:24:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:24:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:24:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:24:54,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:24:54,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:24:54,470 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:24:54,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:24:55,273 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-13 06:24:55,273 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:24:55,323 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:24:55,323 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:24:55,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:55 BoogieIcfgContainer [2024-10-13 06:24:55,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:24:55,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:24:55,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:24:55,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:24:55,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:24:53" (1/3) ... [2024-10-13 06:24:55,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432b63ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:24:55, skipping insertion in model container [2024-10-13 06:24:55,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:53" (2/3) ... [2024-10-13 06:24:55,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432b63ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:24:55, skipping insertion in model container [2024-10-13 06:24:55,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:55" (3/3) ... [2024-10-13 06:24:55,334 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-1.i [2024-10-13 06:24:55,352 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:24:55,352 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:24:55,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:24:55,416 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;@4f313379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:24:55,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:24:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:24:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:24:55,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:55,433 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:55,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash -885130331, now seen corresponding path program 1 times [2024-10-13 06:24:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511090572] [2024-10-13 06:24:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:55,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:24:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:55,462 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-10-13 06:24:55,464 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-10-13 06:24:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:55,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:24:55,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-10-13 06:24:55,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:55,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:55,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511090572] [2024-10-13 06:24:55,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511090572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:55,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:55,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:24:55,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734782615] [2024-10-13 06:24:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:55,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:24:55,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:24:55,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:24:55,865 INFO L87 Difference]: Start difference. First operand has 95 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:24:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:55,920 INFO L93 Difference]: Finished difference Result 187 states and 298 transitions. [2024-10-13 06:24:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:24:55,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-10-13 06:24:55,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:55,936 INFO L225 Difference]: With dead ends: 187 [2024-10-13 06:24:55,936 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:24:55,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:24:55,944 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:55,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:24:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:24:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 06:24:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:24:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2024-10-13 06:24:55,986 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 117 [2024-10-13 06:24:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:55,986 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2024-10-13 06:24:55,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:24:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2024-10-13 06:24:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:24:55,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:55,992 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:56,002 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-10-13 06:24:56,193 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-10-13 06:24:56,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:56,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash 474815437, now seen corresponding path program 1 times [2024-10-13 06:24:56,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:56,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049746949] [2024-10-13 06:24:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:56,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:24:56,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:56,199 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-10-13 06:24:56,204 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-10-13 06:24:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:56,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:24:56,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:24:56,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:56,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:56,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049746949] [2024-10-13 06:24:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049746949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:56,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:56,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:24:56,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857068096] [2024-10-13 06:24:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:56,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:56,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:56,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:24:56,575 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:56,685 INFO L93 Difference]: Finished difference Result 190 states and 282 transitions. [2024-10-13 06:24:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:56,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-13 06:24:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:56,689 INFO L225 Difference]: With dead ends: 190 [2024-10-13 06:24:56,689 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 06:24:56,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:24:56,693 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:56,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 505 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 06:24:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-13 06:24:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:24:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-10-13 06:24:56,714 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 117 [2024-10-13 06:24:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:56,718 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-10-13 06:24:56,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-10-13 06:24:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:24:56,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:56,723 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:56,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 06:24:56,924 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-10-13 06:24:56,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:56,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash 532073739, now seen corresponding path program 1 times [2024-10-13 06:24:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:56,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142954679] [2024-10-13 06:24:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:56,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:24:56,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:56,929 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-10-13 06:24:56,942 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-10-13 06:24:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:57,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:24:57,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:24:57,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:24:57,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142954679] [2024-10-13 06:24:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142954679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:57,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:57,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:24:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348022518] [2024-10-13 06:24:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:57,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:24:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:57,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:24:57,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:24:57,289 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:57,382 INFO L93 Difference]: Finished difference Result 196 states and 287 transitions. [2024-10-13 06:24:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:24:57,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-13 06:24:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:57,384 INFO L225 Difference]: With dead ends: 196 [2024-10-13 06:24:57,384 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 06:24:57,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:24:57,386 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:57,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 627 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 06:24:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-13 06:24:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:24:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-10-13 06:24:57,396 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 117 [2024-10-13 06:24:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:57,396 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-10-13 06:24:57,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-10-13 06:24:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:24:57,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:57,398 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:57,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 06:24:57,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:24:57,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:57,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash 532133321, now seen corresponding path program 1 times [2024-10-13 06:24:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:57,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616936990] [2024-10-13 06:24:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:57,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:24:57,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:57,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:24:57,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 06:24:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:57,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 06:24:57,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:24:58,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:24:58,145 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-10-13 06:24:58,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:58,341 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-10-13 06:24:58,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:58,477 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-10-13 06:24:58,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:58,582 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-10-13 06:24:58,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:58,805 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 48 treesize of output 33 [2024-10-13 06:24:58,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:24:58,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2024-10-13 06:24:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 06:24:58,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:24:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:24:59,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:24:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616936990] [2024-10-13 06:24:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616936990] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:24:59,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:24:59,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-13 06:24:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651270860] [2024-10-13 06:24:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:59,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:59,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:24:59,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:59,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:24:59,096 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:59,768 INFO L93 Difference]: Finished difference Result 269 states and 390 transitions. [2024-10-13 06:24:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-10-13 06:24:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:59,770 INFO L225 Difference]: With dead ends: 269 [2024-10-13 06:24:59,770 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 06:24:59,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:24:59,772 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 168 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:59,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 345 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:24:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 06:24:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-10-13 06:24:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.4189189189189189) internal successors, (210), 149 states have internal predecessors, (210), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:24:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 244 transitions. [2024-10-13 06:24:59,784 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 244 transitions. Word has length 117 [2024-10-13 06:24:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:59,785 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 244 transitions. [2024-10-13 06:24:59,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:24:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 244 transitions. [2024-10-13 06:24:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:24:59,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:59,787 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:59,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 06:24:59,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:24:59,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:59,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash 954835147, now seen corresponding path program 1 times [2024-10-13 06:24:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:24:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436824067] [2024-10-13 06:24:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:24:59,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:24:59,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:24:59,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 06:25:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:00,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 06:25:00,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:00,369 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-10-13 06:25:00,425 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-10-13 06:25:00,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-13 06:25:00,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:00,644 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 35 treesize of output 26 [2024-10-13 06:25:00,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:00,659 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 39 treesize of output 26 [2024-10-13 06:25:00,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:00,675 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 39 treesize of output 26 [2024-10-13 06:25:00,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:00,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2024-10-13 06:25:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 231 proven. 18 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-13 06:25:00,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:25:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 06:25:00,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436824067] [2024-10-13 06:25:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436824067] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:25:00,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:25:00,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-10-13 06:25:00,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583752447] [2024-10-13 06:25:00,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:25:00,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:25:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:25:00,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:25:00,946 INFO L87 Difference]: Start difference. First operand 168 states and 244 transitions. Second operand has 11 states, 9 states have (on average 8.0) internal successors, (72), 11 states have internal predecessors, (72), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-13 06:25:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:02,080 INFO L93 Difference]: Finished difference Result 345 states and 495 transitions. [2024-10-13 06:25:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:25:02,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.0) internal successors, (72), 11 states have internal predecessors, (72), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) Word has length 117 [2024-10-13 06:25:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:02,087 INFO L225 Difference]: With dead ends: 345 [2024-10-13 06:25:02,087 INFO L226 Difference]: Without dead ends: 178 [2024-10-13 06:25:02,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:25:02,089 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 336 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:02,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 233 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:25:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-13 06:25:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-10-13 06:25:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 155 states have internal predecessors, (214), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:25:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2024-10-13 06:25:02,105 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 117 [2024-10-13 06:25:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:02,106 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2024-10-13 06:25:02,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.0) internal successors, (72), 11 states have internal predecessors, (72), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-13 06:25:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2024-10-13 06:25:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:25:02,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:02,108 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:25:02,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 06:25:02,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:25:02,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -633512755, now seen corresponding path program 1 times [2024-10-13 06:25:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348028014] [2024-10-13 06:25:02,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:02,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:25:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:02,314 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:25:02,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 06:25:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:02,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:25:02,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:02,703 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-10-13 06:25:03,177 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 80 treesize of output 34 [2024-10-13 06:25:03,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:03,682 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 140 treesize of output 67 [2024-10-13 06:25:03,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:03,858 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 135 treesize of output 77 [2024-10-13 06:25:04,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:04,361 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 145 treesize of output 90 [2024-10-13 06:25:04,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:04,809 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 160 treesize of output 93 [2024-10-13 06:25:05,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:05,192 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 160 treesize of output 93 [2024-10-13 06:25:05,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:05,527 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 160 treesize of output 93 [2024-10-13 06:25:06,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:06,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 75 [2024-10-13 06:25:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 52 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-13 06:25:06,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:25:32,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348028014] [2024-10-13 06:25:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348028014] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:25:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [159111789] [2024-10-13 06:25:32,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:32,633 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:25:32,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:25:32,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:25:32,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-13 06:25:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:33,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 06:25:33,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:34,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:25:38,039 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 64 treesize of output 32 [2024-10-13 06:25:41,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:41,863 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 1 case distinctions, treesize of input 112 treesize of output 63 [2024-10-13 06:25:43,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:43,186 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 1 case distinctions, treesize of input 112 treesize of output 63 [2024-10-13 06:25:44,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:44,692 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 1 case distinctions, treesize of input 112 treesize of output 63 [2024-10-13 06:25:46,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:46,250 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 1 case distinctions, treesize of input 112 treesize of output 63 [2024-10-13 06:25:47,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:47,883 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 1 case distinctions, treesize of input 112 treesize of output 63 [2024-10-13 06:25:49,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:49,491 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 1 case distinctions, treesize of input 112 treesize of output 63 [2024-10-13 06:25:51,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:51,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 67 [2024-10-13 06:25:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 06:25:52,363 INFO L311 TraceCheckSpWp]: Computing backward predicates...